Primality Certificate for (9539^2341-1)/9538 | ||
| Andy Steward | 9,313 digits | 06 May 2008 |
|---|---|---|
| Originally by Tom Wu 2005 | ||
This certificate uses a theorem of Coppersmith and Howgrave-Graham to prove an integer N prime by making use of a partial prime factorization of N-1.
As N is a Generalized Repunit, we make use of the algebraic factorization of N-1 to arrive at the following 29.778233% factorization of N-1:
| From | Factorisation |
|---|---|
| 9539 | 9539 |
| Φ2 | 2 · 2 · 3 · 3 · 5 · 53 |
| Φ3 | 43 · 2116327 |
| Φ4 | 2 · 45496261 |
| Φ5 | 71 · 2166721 · 53826431 |
| Φ6 | 3 · 7 · 13 · 333271 |
| Φ9 | 163 · 937 · 508789 · 689959 · 14051701 |
| Φ10 | 5 · 11 · 911 · 57041 · 2896661 |
| Φ12 | 73 · 113419709410177 |
| Φ13 | 131 · 1093 · 549719 · 18682975430809 · 386012588592996424261177 |
| Φ15 | 36062431 · 68530351 · 27735711028529761 |
| Φ18 | 3 · 37 · 159185503 · 42637388810671 |
| Φ20 | 61 · p31 |
| Φ26 | 399961058641 · 143498144501141 · 9888369009230578062353 |
| Φ30 | 31 · 421 · 1831 · 2313570691 · 1240090579574071 |
| Φ36 | 1621 · 236881 · 233956190701 · 6318098630590512432721201561 |
| Φ39 | 5425690148099419255700917654771 · p65 |
| Φ45 | 3375451 · 15952771 · 48773827120561855909610815908541 · p51 |
| Φ52 | 18606121 · 156132289 · p81 |
| Φ60 | 161881 · 4337941801 · p49 |
| Φ65 | 1951 · 47016971 · 63410033051 · 15197274010920739549168631 · p145 |
| Φ78 | 13 · 79 · 1733236645227181285960884031057465813060807 · p51 |
| Φ90 | 446024735641 · 330219001931269878858194045566221901681 · p46 |
| Φ117 | p287 |
| Φ130 | 521 · 50441 · 131044488901 · 2212134083619763352690992790032361 · c140 |
| Φ156 | 157 · 2341 · 208320276529 · 20762988402624635899968656651089 · c143 |
| Φ180 | 181 · 1801 · c186 |
| Φ195 | 1171 · 765326898895531051 · 4487931955994363214001 · c340 |
| Φ234 | 429604615441 · 314838755752950596946637 · 115636606173160344167321437087370708467 · p214 |
| Φ260 | 397541 · c377 |
| Φ390 | c383 |
| Φ468 | 23566996441 · 1665610489871126725921395738949 · c533 |
| Φ585 | 486721 · 1697973760081 · 181649642150397999063331 · c1105 |
| Φ780 | 233221 · 1063921 · p753 |
| Φ1170 | 841353445531 · 4015223077321 · 3108674579341037851 · c1104 |
| Φ2340 | 3672815390784541 · 664305213152161215181 · 33506623280991790217341 · c2234 |
We need the product F of all the prime factors from this partial factorization:
| 467 5950747431 8881898780 9278499538 7654684874 7184613510 2919654738 6918301425 7426326276 9518613962 5922761215 0267327196 0647882721 9285731785 6321982115 6935190274 1141322660 8474595950 2621803977 7036377425 0221123283 8038235008 4282875944 2319680184 6199883231 8554558965 7291792794 6071000788 4791072114 7171044090 1141345852 4457250647 6704158418 2912064333 7231063268 0953145747 8629804075 7082156849 1845347120 9233277675 5136446537 7752996391 1075046108 4329759136 5236287880 9267240872 5562242116 6683046610 6897824549 5300466365 0720235333 7628416207 1726093088 1478859284 6115352519 3601290212 1750341054 6729546689 0914548414 5305431013 4492438575 1262493965 2909831243 2151668332 0595790046 6623816519 1043119979 1496959874 5878340273 5674528328 6024960352 9227058258 0434974075 8371201959 0514526612 0935950621 |
| 3343529 1408856040 1410753212 9457270901 2657026701 0457093540 4342470116 7945466965 6974284147 9087306258 8187208670 8504447169 7172710356 0958099721 8590454975 5045314796 8773329258 6846431005 1591554970 5188839684 4262553523 0550934168 2688525531 2944505887 5268122221 6105680788 5496740223 6931853275 9201223761 |
| 2137 7290043441 6525451537 8603192134 8891759789 2584989773 5952964503 1653179115 8909318126 9688777785 5238503952 3567783487 2751367756 5987009923 2189431640 6816303673 7786104201 7960163413 6351003996 0810301811 2316038147 6487629799 |
| 11739 6627590454 8934542581 7564724577 0302978764 9537704927 6353145123 8353996357 5530443634 8893656423 1372656003 0473411311 0396025448 8428374121 7836237841 |
| 1 1089700016 9557650714 2611225393 5468754941 7996953629 4962867419 6493512268 7206803209 |
| 59370 1097690288 9963858661 3634281044 2839719550 5876415063 4401232651 |
| 1 8100292396 2551529062 9043949695 3498389678 8165340589 |
| 1 2266300431 8746686974 1057946910 3995721417 4170627061 |
| 669215491 4349948334 2384350083 8833096521 7412770401 |
| 218729 5029146941 3901452528 6090764862 1805829801 |
| 173 3236645227 1812859608 8403105746 5813060807 |
| 330219001 9312698788 5819404556 6221901681 |
| 115636606 1731603441 6732143708 7370708467 |
| 2212 1340836197 6335269099 2790032361 |
| 48 7738271205 6185590961 0815908541 |
| 20 7629884026 2463589996 8656651089 |
| 5 4256901480 9941925570 0917654771 |
| 1 6656104898 7112672592 1395738949 |
| 1 1238101507 4811216849 2398343781 |
| 63180986 3059051243 2721201561 |
| 151972 7401092073 9549168631 |
| 3860 1258859299 6424261177 |
| 3148 3875575295 0596946637 |
| 1816 4964215039 7999063331 |
| 335 0662328099 1790217341 |
| 98 8836900923 0578062353 |
| 44 8793195599 4363214001 |
| 6 6430521315 2161215181 |
| 310867457 9341037851 |
| 76532689 8895531051 |
| 2773571 1028529761 |
| 367281 5390784541 |
| 124009 0579574071 |
| 14349 8144501141 |
| 11341 9709410177 |
| 4263 7388810671 |
| 1868 2975430809 |
| 401 5223077321 |
| 169 7973760081 |
| 84 1353445531 |
| 44 6024735641 |
| 42 9604615441 |
| 39 9961058641 |
| 23 3956190701 |
| 20 8320276529 |
| 13 1044488901 |
| 6 3410033051 |
| 2 3566996441 |
| 4337941801 |
| 2313570691 |
| 159185503 |
| 156132289 |
| 68530351 |
| 53826431 |
| 47016971 |
| 45496261 |
| 36062431 |
| 18606121 |
| 15952771 |
| 14051701 |
| 3375451 |
| 2896661 |
| 2166721 |
| 2116327 |
| 1063921 |
| 689959 |
| 549719 |
| 508789 |
| 486721 |
| 397541 |
| 333271 |
| 236881 |
| 233221 |
| 161881 |
| 57041 |
| 50441 |
| 9539 |
| 2341 |
| 1951 |
| 1831 |
| 1801 |
| 1621 |
| 1171 |
| 1093 |
| 937 |
| 911 |
| 521 |
| 421 |
| 181 |
| 163 |
| 157 |
| 131 |
| 79 |
| 73 |
| 71 |
| 61 |
| 53 |
| 43 |
| 37 |
| 31 |
| 132 |
| 11 |
| 7 |
| 52 |
| 34 |
| 23 |
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) = 29.778233%
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.
Given such a witness, Pocklington's Theorem shows that every prime factor of N ≡ 1 (mod F). As F4>N, N can have no more than three prime factors.
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 has exactly two prime factors if and only if c12-4·c2 is a perfect square.
Here, c12-4·c2 is ≡ 21 (mod 64) and therefore cannot be a square and this stage of the proof is passed.
We are left with two possibilities for N: either it has exactly three prime factors or it is prime. The non-existence of exactly three factors is demonstrated by the Theorem of Coppersmith and Howgrave-Graham, here performed by a Pari/GP script written by John Renze and David Broadhurst. Here is the stdout:
realprecision = 2003 significant digits (2000 digits displayed)
Welcome to the CHG primality prover!
------------------------------------
Input file is: IO\25430925.cin
Certificate file is: IO\25430925.chg
Found values of n, F and G.
Number to be tested has 9313 digits.
Modulus has 2773 digits.
Modulus is 29.77823339% of n.
NOTICE: This program assumes that n has passed
a BLS PRP-test with n, F, and G as given. If
not, then any results will be invalid!
Square test passed for F >> G. Using modified right endpoint.
Search for factors congruent to 1.
Running CHG with h = 6, u = 2. Right endpoint has 994 digits.
Done! Time elapsed: 66641ms.
Running CHG with h = 5, u = 1. Right endpoint has 758 digits.
Done! Time elapsed: 30734ms.
Running CHG with h = 5, u = 1. Right endpoint has 592 digits.
Done! Time elapsed: 36469ms.
Running CHG with h = 5, u = 1. Right endpoint has 259 digits.
Done! Time elapsed: 21000ms.
A certificate has been saved to the file: IO\25430925.chg
Running David Broadhurst's verifier on the saved certificate...
Testing a PRP called "IO\25430925.cin".
Pol[1, 1] with [h, u]=[5, 1] has ratio=1.048203082 E-394 at X, ratio=7.38800918 E-653 at Y, witness=29.
Pol[2, 1] with [h, u]=[4, 1] has ratio=1.378306325 E-333 at X, ratio=1.517953822 E-333 at Y, witness=2.
Pol[3, 1] with [h, u]=[4, 1] has ratio=7.459576484 E-168 at X, ratio=2.760424603 E-167 at Y, witness=2.
Pol[4, 1] with [h, u]=[6, 2] has ratio=3.895856371 E-210 at X, ratio=4.200329190 E-472 at Y, witness=23.
Validated in 1 sec.
Congratulations! n is prime!
The actual input file containing N and F and the output certificate are included in this file.