Primality Certificate for (6045^2341-1)/6044 | ||
| Andy Steward | 8,849 digits | 12 April 2008 |
|---|---|---|
| Originally by A.A.D.Steward 2008 | ||
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.911341% factorization of N-1:
| From | Factorisation |
|---|---|
| 6045 | 3 · 5 · 13 · 31 |
| Φ2 | 2 · 3023 |
| Φ3 | 7 · 7 · 313 · 2383 |
| Φ4 | 2 · 3677 · 4969 |
| Φ5 | 41 · 2551 · 12769172531 |
| Φ6 | 2251 · 16231 |
| Φ9 | 36933993037 · 1321148293723 |
| Φ10 | 11 · 121372611917771 |
| Φ12 | 37 · 34849 · 1035602677 |
| Φ13 | 77611 · 65330149 · p33 |
| Φ15 | 211 · 8221 · 9721 · 8231381881 · 12844221751 |
| Φ18 | 19 · 1297 · 1980086916396864007 |
| Φ20 | 421 · 4235340526322707370616659581 |
| Φ26 | 79 · 131 · 547 · p39 |
| Φ30 | 16741 · 106527290953230845446777981 |
| Φ36 | 181 · 3169 · p40 |
| Φ39 | 207519283633713515604661 · p68 |
| Φ45 | 56611 · 176910301 · 286734601 · 397456541011 · 15726278497205810251 · p39 |
| Φ52 | 53 · 157 · 10310606780612801732317 · 179671847381031209741684342053 · p36 |
| Φ60 | 61 · 13660550641 · p49 |
| Φ65 | 1301 · c179 |
| Φ78 | 1327 · 1951 · 119809 · 613121285286823 · 195730946261134751689 · 1211719088586588356113 · 125706486529383856513327 |
| Φ90 | 9580390741 · 2020874574153918217961431 · p57 |
| Φ117 | 13111489 · 111367621 · 46445697091 · 451559550268861450417 · 168563820303476932899007 · 369204678161206446825683269037641 · c170 |
| Φ130 | 108075910475100881 · c165 |
| Φ156 | 1093 · 1377923124393817 · c164 |
| Φ180 | 3612229456141 · 3178804620231326262961 · 1730390128622539933441681 · p124 |
| Φ195 | p364 |
| Φ234 | 198082653654313974313 · p252 |
| Φ260 | 6761 · 30161 · c355 |
| Φ390 | 2731 · c360 |
| Φ468 | 1873 · 188137 · 183650221 · 14272215889933 · 165532545655373551357 · c495 |
| Φ585 | 6137732905490892421 · c1071 |
| Φ780 | 1963221994501 · 3644416513323855766381 · 40737125222580449735207529421 · p664 |
| Φ1170 | 1171 · 2341 · 167047921 · c1075 |
| Φ2340 | 552241 · c2173 |
We need the product F of all the prime factors from this partial factorization:
| 3660 1829288230 7251786405 2965603974 8869421233 5042918263 3837666712 7053945035 8034677847 6338227771 0577953605 9962706047 2755989872 9870324680 7747681857 2179719001 2159894566 4631209630 9402853772 6107138166 0518933905 4757194405 9861302361 9080708800 7976696157 4850167960 6166335439 4766117979 6991522911 4779117777 2071477586 9843213049 0780296742 4960062610 8058438336 1939241745 4678862208 9518330423 9907284947 6433834159 2808521212 3599383999 8297046828 5970223269 7870861378 2591638958 5977378702 2565851768 2636969877 6848332955 2720759709 8126088386 0158958490 1869566747 3542606287 4417825847 9561979133 0557485501 3161021849 9799404231 2792432511 4812177722 7540572775 8478666329 8011494658 0366863201 2462313701 |
| 1033 0400247419 5502614577 8224342366 0176540126 6555904968 6240162502 2734211256 5226738014 4360095248 9382220028 9905908816 9225666079 2817263852 1978101108 4166647691 0822772324 4680532496 3131561861 0950397036 9876555654 5648606316 4369486669 5376539157 8659728002 7109017139 5773202835 3619098578 3089105733 6848330700 3855783049 8354422347 0842023047 5630633619 1451019082 6726883136 9599504321 |
| 91 9787554013 4848446222 5281742417 0743507687 4096493006 4198346160 6632513491 1235485537 8421582677 3987766121 5565329167 4242769483 7428589647 6144689716 1290799003 1141629758 9767204939 0950557205 5343690414 8332734273 3131369285 1833144724 5949675652 5803845568 3094294377 |
| 1617 4819955946 9815822866 6503638134 1207130683 7277511022 3459603169 8512302672 8329851606 9238920038 3637094988 5220593796 8544245221 |
| 27313730 2279530123 5811893243 3543201469 8171857412 6289148873 3358870221 |
| 2928119 1341970089 1666439192 4603185865 8042519805 1196261531 |
| 381542441 4807930930 9485862611 7376617965 9720007301 |
| 4151020214 5528513817 7044995820 2273024309 |
| 420531092 5020738600 1192161056 7309823727 |
| 315836022 9167398289 7624651058 9638834031 |
| 367765 9636536250 5380845830 0403266881 |
| 469 6675810829 2011704255 5665330739 |
| 369 2046781612 0644682568 3269037641 |
| 1796718473 8103120974 1684342053 |
| 407371252 2258044973 5207529421 |
| 42353405 2632270737 0616659581 |
| 1065272 9095323084 5446777981 |
| 20208 7457415391 8217961431 |
| 17303 9012862253 9933441681 |
| 2075 1928363371 3515604661 |
| 1685 6382030347 6932899007 |
| 1257 0648652938 3856513327 |
| 103 1060678061 2801732317 |
| 36 4441651332 3855766381 |
| 31 7880462023 1326262961 |
| 12 1171908858 6588356113 |
| 4 5155955026 8861450417 |
| 1 9808265365 4313974313 |
| 1 9573094626 1134751689 |
| 1 6553254565 5373551357 |
| 1572627849 7205810251 |
| 613773290 5490892421 |
| 198008691 6396864007 |
| 10807591 0475100881 |
| 137792 3124393817 |
| 61312 1285286823 |
| 12137 2611917771 |
| 1427 2215889933 |
| 361 2229456141 |
| 196 3221994501 |
| 132 1148293723 |
| 39 7456541011 |
| 4 6445697091 |
| 3 6933993037 |
| 1 3660550641 |
| 1 2844221751 |
| 1 2769172531 |
| 9580390741 |
| 8231381881 |
| 1035602677 |
| 286734601 |
| 183650221 |
| 176910301 |
| 167047921 |
| 111367621 |
| 65330149 |
| 13111489 |
| 552241 |
| 188137 |
| 119809 |
| 77611 |
| 56611 |
| 34849 |
| 30161 |
| 16741 |
| 16231 |
| 9721 |
| 8221 |
| 6761 |
| 4969 |
| 3677 |
| 3169 |
| 3023 |
| 2731 |
| 2551 |
| 2383 |
| 2341 |
| 2251 |
| 1951 |
| 1873 |
| 1327 |
| 1301 |
| 1297 |
| 1171 |
| 1093 |
| 547 |
| 421 |
| 313 |
| 211 |
| 181 |
| 157 |
| 131 |
| 79 |
| 61 |
| 53 |
| 41 |
| 37 |
| 31 |
| 19 |
| 13 |
| 11 |
| 72 |
| 5 |
| 3 |
| 22 |
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.911341%
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 = 34 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 ≡ 32 (mod 63) 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 = 1502 significant digits (1500 digits displayed)
Welcome to the CHG primality prover!
------------------------------------
Input file is: IO\179D0925.cin
Certificate file is: IO\179D0925.chg
Found values of n, F and G.
Number to be tested has 8849 digits.
Modulus has 2647 digits.
Modulus is 29.91134073% 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 909 digits.
Done! Time elapsed: 63125ms.
Running CHG with h = 5, u = 1. Right endpoint has 660 digits.
Done! Time elapsed: 26953ms.
Running CHG with h = 5, u = 1. Right endpoint has 438 digits.
Done! Time elapsed: 12641ms.
A certificate has been saved to the file: IO\179D0925.chg
Running David Broadhurst's verifier on the saved certificate...
Testing a PRP called "IO\179D0925.cin".
Pol[1, 1] with [h, u]=[4, 1] has ratio=3.538894116 E-413 at X, ratio=2.531687367 E-445 at Y, witness=7.
Pol[2, 1] with [h, u]=[4, 1] has ratio=3.276268834 E-224 at X, ratio=5.429959888 E-223 at Y, witness=2.
Pol[3, 1] with [h, u]=[6, 2] has ratio=5.015799412 E-81 at X, ratio=3.216150347 E-498 at Y, witness=2.
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.