Primality Certificate for (9096^2011-1)/9095

Andy Steward7,958 digits19 September 2005
Originally by A.A.D.Steward 2005

This certificate uses a theorem of Brillhart, Lehmer and Selfridge to prove an integer N prime by making use of a partial prime factorization of N-1.

Factorizing N-1

As N is a Generalized Repunit, we make use of the algebraic factorization of N-1 to arrive at the following 35.004210% factorization of N-1:

From Factorisation
90962 · 2 · 2 · 3 · 379
Φ211 · 827
Φ313 · 397 · 16033
Φ55 · 881 · 1554188325061
Φ67 · 7 · 1688329
Φ10101 · 181 · 211 · 1774482251
Φ15691 · 169293991 · 1320072571 · 303415992031
Φ3031 · 48275881 · 31315507519175436591871
Φ67c262
Φ1348443 · 28409 · 2955103 · 1760217167 · c238
Φ20133761120977 · c513
Φ335c1046
Φ4026671501149 · 445370274913 · 23006594035719083149 · p482
Φ670c1046
Φ10052011 · 4021 · 156781 · 11270071 · c2072
Φ201034171 · p2086

From this partial factorization, we use sufficient of the largest prime factors of N-1 so that their product F is at least N 1/3 :

548697 5934429169 0916454758 3410604793 5326513875 8566837554 0534663647 1949969422 7997133684 6405004626 5268045739 6872983508 7344300129 4775238461 3238800766 1651236849 1666721311 9870407477 9511770300 3785065926 6708789945 0490123730 0415003449 0086632308 2071227495 4130780747 7039275391 0165745253 4986073576 4796605213 0063146597 5594654092 6173277253 2574992754 7695507211 3260713136 9237952809 1526942016 7648102109 6962811211 0070455820 0020127056 3665398393 2608949518 0149569914 1301196217 0954859993 0659527208 0784004856 6224772795 1543222556 6495553912 7607011192 0598644955 9734674687 0796707917 6039912974 6399493741 0598189428 7660883503 1968429592 0837105012 4640553332 1148354302 4893416383 3004142770 6650753604 1489028698 9727088318 5210641923 1073335021 5231609137 6790705736 6031680401 4382707701 2737326077 9097993227 1448939818 3111292604 4631424288 6198729071 1709084094 2621430915 8649267703 1189885263 1210176744 1843731890 6072165630 4861619754 6226908867 7101973120 7944082025 1931694229 4317502854 3464288135 2011158208 5348450272 8545377351 9407605933 3179819242 5815348636 3860284475 6985618360 7023760470 6258581927 4960140128 2243992857 6182051265 6643987879 1088481935 6202312517 6295801303 2365019518 3937841279 9828281178 0748658541 5792545386 5562006144 6774231739 9523911066 3026889896 3441515806 5519735843 6539864373 1059075132 5514628334 0293826682 4992487260 3055692548 6320315088 0627875263 5541037176 5974147457 2339124729 9620302585 7446531018 1655993121 1348162947 0105852185 1725232890 8028877311 3451555140 2783381151 5882628511 4655445389 8633317899 6754625311 6360379352 8945793680 9024063479 3587401196 1515946732 2664894855 2962784851 1932774262 2902077251 0432451883 5482451842 8740573543 7849659897 3305534022 1704028919 1241492484 7016458848 2017075078 8138623088 2307500286 5613074361 1939434771 5095751608 7427618031 0226899601 3935974614 4936967836 0693890214 0591177490 8310941650 4346243812 8410862284 1021156864 1650179256 1837419234 4165734761 2716612288 0112958909 4587882406 2318041875 5186622568 5090717139 9294597549 0164317376 8820484759 6998866267 4143127929 1415574676 5322682477 4754363155 9425178318 3492724186 3903733895 4037706566 6762723556 7024419381 6791218334 6133504211 1164689531 7912177461 5432741970 9845112411
54 1390016123 1156617413 3956380848 1163641571 3228939796 3021071347 2975981528 2958557252 1161279232 4370927078 4201715814 4015756025 8082617810 4644829507 2434727190 2641715696 9053421790 1452431020 0152806362 9533181195 7295510878 3883035119 9207261588 5673618581 5705099620 0965055536 9014048610 3074081764 2351843217 1903753365 6794771643 5610087394 9784508401 1259570460 3795352283 6620102788 7593886022 5414591737 5397506734 6870959771 2099277010 1365809175 5811751562 4048055573 2545839067 5581393546 3367062931 3371356017
313 1550751917 5436591871
2300659403 5719083149
155 4188325061
44 5370274913
30 3415992031
3 3761120977

Note that all prime factors listed above have been proven. As primes of under 250 decimal digits can be verified in a few seconds, proof of their primality is not included here, in order to save space. Larger prime factors can take from hours to months to prove; certificates for all such factors have been PKZIPped into this file.

We set R = (N-1)/F. Note that GCD(F,R)=1 and Log(F)/Log(N) = 33.367909%

Finding a Witness to Primality

Next, we find an integer witness w such that for each prime factor p of N-1, w(N-1) ≡ 1 mod N and GCD(w(N-1)/p-1,N) = 1. In this case, w = 17 suffices.

Express N in base F

As F2 < N < F3 and N ≡ 1 (mod F), we can let N = c2·F2 + c1·F + 1.

Brillhart, Lehmer and Selfridge's Theorem shows that N is prime if and only if c12-4·c2 is not a square.

Here, c12-4·c2 is ≡ 61 (mod 64) and therefore cannot be a square and N is prime.