Primality Certificate for (7565^2521-1)/7564 | ||
| Andy Steward | 9,775 digits | 28 December 2009 |
|---|---|---|
| Originally by David Broadhurst, Bouk de Water & Bernardo Boncompagni 2009 | ||
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.994429% factorization of N-1:
| From | Factorisation |
|---|---|
| 7565 | 5 · 17 · 89 |
| Φ2 | 2 · 3 · 13 · 97 |
| Φ3 | 103 · 555697 |
| Φ4 | 2 · 73 · 101 · 3881 |
| Φ5 | 3275617190424541 |
| Φ6 | 3 · 7 · 7 · 7 · 55609 |
| Φ7 | 29 · 18597562187 · 347581768717 |
| Φ8 | 2 · 17497 · 54361 · 1721689 |
| Φ9 | 271 · 77617 · 8911020660824593 |
| Φ10 | 11 · 9258091 · 32156161 |
| Φ12 | 4549 · 9013 · 79882273 |
| Φ14 | 71 · 1994651 · 1323338421191641 |
| Φ15 | 241 · 5281 · 438625951 · 19212616492666591 |
| Φ18 | 3 · 19 · 18181 · 40213 · 4497741565381 |
| Φ20 | 41 · 421 · 558808223801 · 1112097104150941 |
| Φ21 | 43 · 211 · 2731 · 8527 · 1146559 · 109863139 · 1319874051932965669561 |
| Φ24 | 577 · 16921 · 2145433 · 53634289 · 9547993969 |
| Φ28 | 9566836229713229991553 · 3672305822053360456505017 |
| Φ30 | 7411 · 1447611585550794840696938731 |
| Φ35 | 894181 · 142661611 · 28784991835160125722879036070706438881 · p42 |
| Φ36 | 37 · 23473 · 101609266501 · p30 |
| Φ40 | 1269074041 · 38172081746407636383281 · p31 |
| Φ42 | 7 · 1009 · 1051 · 39397 · 197269312381 · 609045848762321162654701 |
| Φ45 | 181 · 1621 · 40532368629577411 · 338125691662740039260650533171301 · p39 |
| Φ56 | 682920882337 · 603519697395721 · 8753626666621728473 · p48 |
| Φ60 | 11161 · 46055745180915821802229449661 · p30 |
| Φ63 | 127 · 119701 · 239829206779 · 54418637870726253391 · p102 |
| Φ70 | 40111 · 295525861 · 32230582116607857157727692888243861 · p46 |
| Φ72 | 16273 · 382808008805113 · 50243843082629208970299031789505689 · p40 |
| Φ84 | 3697 · 3016229797393 · 1587141894902929 · p62 |
| Φ90 | 38502494926381 · 10849807434761509104333853786359631 · p46 |
| Φ105 | 5412331 · 351504511 · 17855204011 · p161 |
| Φ120 | 1253521 · 58656571353001 · 81215502853507201 · 188203688607542443441 · 33508999175687841216019603441 · p39 |
| Φ126 | 10459 · 373474868383 · 102181919169603421 · 168120978952373739146724454923414638860306430707718539 · p54 |
| Φ140 | 1177681 · p181 |
| Φ168 | c187 |
| Φ180 | 49681 · 118621 · 2297521 · 106645466014214162646473905501 · c142 |
| Φ210 | p187 |
| Φ252 | 90469 · 20647958941 · 149280707773 · 376585947324936047289781 · c230 |
| Φ280 | 281 · 7380516376658668175956273321 · 33939429020229996566554370281 · c314 |
| Φ315 | 631 · 9999991 · 28122144751 · c539 |
| Φ360 | 9001 · 14486401 · 9456553081 · 75881127961 · 136000482481 · c330 |
| Φ420 | 87332217039901 · 240155345577740781617125900161841 · p327 |
| Φ504 | 2129401 · 19824388417 · 45601494121 · c532 |
| Φ630 | 1721476454355882001 · c541 |
| Φ840 | 316307881 · 1570265688601 · 101596788565986841 · c708 |
| Φ1260 | 2521 · c1114 |
| Φ2520 | 572041 · 10112761 · 320765761 · c2213 |
We need the product F of all the prime factors from this partial factorization:
| 1106600 2283740403 2923194663 5668919705 5957888094 3433629170 2828415440 0624575928 1026821140 9006391822 0573786839 0370147424 1219732851 3815804996 1700487673 7727276505 0903693546 6444652470 9645374641 7892188584 1998688571 8396344855 3121781867 3858552264 5153480318 6467929527 0279514798 8885524558 2255219633 8169761899 6675484979 4358821984 9839776261 |
| 1523250 5676707947 4325111380 2013703699 1837366440 6610683603 5576089912 3906914636 4143572868 5499009203 0185335992 3254297699 5468106234 8663700640 8237182013 2930844003 8767322595 0903577666 4580184161 |
| 1 2936032332 0702377822 4224051230 8548652723 0762108014 0399450793 2148013301 1932110252 4587822557 6029479149 5000534371 9820924051 0142757037 6830366149 7068694691 8785799556 7658024664 7622338321 |
| 4 4854507972 5286376544 4928531893 4810430653 7456836377 8141501426 5407331149 3283769694 5316093375 4268837529 2048610382 1671602995 8397428842 4873787145 8258912431 9425707991 |
| 21 8559821544 9555565749 8484539132 9973092310 5908985546 6959145675 3269059124 3219246227 2269535602 8484555567 |
| 69 7404510664 8759604900 0124158463 6471030761 9128720643 1173430689 |
| 6462 1056421061 9066297432 3023636251 2883560209 1899203307 |
| 1681 2097895237 3739146724 4549234146 3886030643 0707718539 |
| 34210901 1770825520 2142062584 4289770718 6242151281 |
| 323105 7234414024 5009937946 3105031334 5613273511 |
| 295463 2523276315 1689152876 6672012717 7822025691 |
| 33 6092090747 2966174717 6301222585 4541921591 |
| 3943509454 9694946702 3874933780 9091618641 |
| 351567744 3080345306 7575945166 9333196201 |
| 306953530 0799652689 9243508051 1478487991 |
| 28784991 8351601257 2287903607 0706438881 |
| 50243 8430826292 0897029903 1789505689 |
| 32230 5821166078 5715772769 2888243861 |
| 10849 8074347615 0910433385 3786359631 |
| 338 1256916627 4003926065 0533171301 |
| 240 1553455777 4078161712 5900161841 |
| 2 3752542938 8397560992 4494573881 |
| 3981104240 2690062016 9625490001 |
| 2238494355 5470908896 9286563581 |
| 1066454660 1421416264 6473905501 |
| 460557451 8091582180 2229449661 |
| 339394290 2022999656 6554370281 |
| 335089991 7568784121 6019603441 |
| 73805163 7665866817 5956273321 |
| 14476115 8555079484 0696938731 |
| 36723 0582205336 0456505017 |
| 6090 4584876232 1162654701 |
| 3765 8594732493 6047289781 |
| 381 7208174640 7636383281 |
| 95 6683622971 3229991553 |
| 13 1987405193 2965669561 |
| 1 8820368860 7542443441 |
| 5441863787 0726253391 |
| 875362666 6621728473 |
| 172147645 4355882001 |
| 10218191 9169603421 |
| 10159678 8565986841 |
| 8121550 2853507201 |
| 4053236 8629577411 |
| 1921261 6492666591 |
| 891102 0660824593 |
| 327561 7190424541 |
| 158714 1894902929 |
| 132333 8421191641 |
| 111209 7104150941 |
| 60351 9697395721 |
| 38280 8008805113 |
| 8733 2217039901 |
| 5865 6571353001 |
| 3850 2494926381 |
| 449 7741565381 |
| 301 6229797393 |
| 157 0265688601 |
| 68 2920882337 |
| 55 8808223801 |
| 37 3474868383 |
| 34 7581768717 |
| 23 9829206779 |
| 19 7269312381 |
| 14 9280707773 |
| 13 6000482481 |
| 10 1609266501 |
| 7 5881127961 |
| 4 5601494121 |
| 2 8122144751 |
| 2 0647958941 |
| 1 9824388417 |
| 1 8597562187 |
| 1 7855204011 |
| 9547993969 |
| 9456553081 |
| 1269074041 |
| 438625951 |
| 351504511 |
| 320765761 |
| 316307881 |
| 295525861 |
| 142661611 |
| 109863139 |
| 79882273 |
| 53634289 |
| 32156161 |
| 14486401 |
| 10112761 |
| 9999991 |
| 9258091 |
| 5412331 |
| 2297521 |
| 2145433 |
| 2129401 |
| 1994651 |
| 1721689 |
| 1253521 |
| 1177681 |
| 1146559 |
| 894181 |
| 572041 |
| 555697 |
| 119701 |
| 118621 |
| 90469 |
| 77617 |
| 55609 |
| 54361 |
| 49681 |
| 40213 |
| 40111 |
| 39397 |
| 23473 |
| 18181 |
| 17497 |
| 16921 |
| 16273 |
| 11161 |
| 10459 |
| 9013 |
| 9001 |
| 8527 |
| 7411 |
| 5281 |
| 4549 |
| 3881 |
| 3697 |
| 2731 |
| 2521 |
| 1621 |
| 1051 |
| 1009 |
| 631 |
| 577 |
| 421 |
| 281 |
| 271 |
| 241 |
| 211 |
| 181 |
| 127 |
| 103 |
| 101 |
| 97 |
| 89 |
| 73 |
| 71 |
| 43 |
| 41 |
| 37 |
| 29 |
| 19 |
| 17 |
| 13 |
| 11 |
| 74 |
| 5 |
| 33 |
| 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.994429%
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 = 1081 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 ≡ 17 (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 = 1252 significant digits (1250 digits displayed)
Welcome to the CHG primality prover!
------------------------------------
Input file is: IO\1D8D09D9.cin
Certificate file is: IO\1D8D09D9.chg
Found values of n, F and G.
Number to be tested has 9775 digits.
Modulus has 2932 digits.
Modulus is 29.99442924% 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 980 digits.
Done! Time elapsed: 201437ms.
Running CHG with h = 5, u = 1. Right endpoint has 688 digits.
Done! Time elapsed: 32875ms.
Running CHG with h = 5, u = 1. Right endpoint has 398 digits.
Done! Time elapsed: 15109ms.
A certificate has been saved to the file: IO\1D8D09D9.chg
Running David Broadhurst's verifier on the saved certificate...
Testing a PRP called "IO\1D8D09D9.cin".
Pol[1, 1] with [h, u]=[4, 1] has ratio=6.16870964 E-398 at X, ratio=5.660001890 E-580 at Y, witness=11.
Pol[2, 1] with [h, u]=[4, 1] has ratio=3.823983703 E-291 at X, ratio=2.422086806 E-290 at Y, witness=3.
Pol[3, 1] with [h, u]=[6, 2] has ratio=0.00000001119161487 at X, ratio=2.713709000 E-584 at Y, witness=5.
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.