Primality Certificate for (4616^2017-1)/4615 | ||
| Andy Steward | 7,388 digits | 15 July 2001 |
|---|---|---|
| Originally by David Broadhurst & Bouk de Water 2001 | ||
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.
As N is a Generalized Repunit, we make use of the algebraic factorization of N-1 to arrive at the following 33.965825% factorization of N-1:
| From | Factorisation |
|---|---|
| 4616 | 2 · 2 · 2 · 577 |
| Φ2 | 3 · 3 · 3 · 3 · 3 · 19 |
| Φ3 | 1627 · 13099 |
| Φ4 | 21307457 |
| Φ6 | 3 · 7 · 487 · 2083 |
| Φ7 | 44269 · 218569311351547213 |
| Φ8 | 17 · 89 · 300071170649 |
| Φ9 | 109 · 1299819511 · 68278701187 |
| Φ12 | 454007659884481 |
| Φ14 | 29 · 7920613 · 42105994979273 |
| Φ16 | 7618630845169 · 27055120371396113 |
| Φ18 | 3 · 37 · 87150889104151789711 |
| Φ21 | 43 · 211 · 463 · 1303 · p35 |
| Φ24 | 73 · 193 · 409 · 35770328129069487449761 |
| Φ28 | 261101 · 11560494908734913 · 31003064188958721577957 |
| Φ32 | 7500514657 · p49 |
| Φ36 | 10406557081 · p34 |
| Φ42 | 7 · 379 · 10501 · 1292887 · 171822729767347 · 15124275669554773 |
| Φ48 | 21313 · 98641 · 235498561 · p41 |
| Φ56 | 673 · 953 · p83 |
| Φ63 | 127 · 631 · 10459 · 352268410538069173 · 189511265770551221591557 · 227074997700637703943267896893 · p53 |
| Φ72 | 253153 · 5008452982227572836958569 · p58 |
| Φ84 | 7284761287152763009 · p70 |
| Φ96 | 97 · 2689 · c112 |
| Φ112 | 113 · 337 · 449 · 24977 · 3485441 · 124497184001 · 40711056368417 · 19387557289907633832763194193 · c105 |
| Φ126 | 757 · 8821 · 1952623 · 105069440791699243307322558769 · 977496516091323872099940337813 · p60 |
| Φ144 | 1153 · 8205377329 · 309754366054981553209385377 · p137 |
| Φ168 | 33669873217 · 314071573537 · 14857827018464473 · c138 |
| Φ224 | 1486020246905046497 · 4477364001774694409410529 · c309 |
| Φ252 | 1009 · c261 |
| Φ288 | 3192769 · 38974076431482825787969 · c323 |
| Φ336 | 353473 · 3277447258849 · p334 |
| Φ504 | 1210639129360566798184993 · c504 |
| Φ672 | 2017 · 161751533404275739009 · 1669947878869207154025313 · p656 |
| Φ1008 | 1508977 · 10296721 · 629290903249 · 14096586228481 · c1018 |
| Φ2016 | c2111 |
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 :
| 635003 9213066361 9999324627 0877750745 7266444118 8879489339 1798057367 4582956010 9316458565 9382762937 7210291893 7534654064 1136843942 3655305864 0252532652 3409993601 5991605242 2493814273 0623446327 7797205887 0294208916 8859863585 4170734209 5982132872 7255065555 0897614201 3539781493 7639122979 5566063132 1017904521 0318762628 7899626442 7864596720 0996469199 7833136405 1749180571 4421525042 6070968292 8166702199 8279416743 4646008558 1524812503 6667062325 9015824417 8912693615 3123306017 4928759105 6593312389 0676409114 4262901986 7064170150 4047666588 7664026436 1805586853 8133179714 1777997088 6412119829 1054842276 3559064842 4180838892 1090394479 2378796998 7901511178 5757359448 7032969863 6624373569 |
| 5077 2068419734 5327523434 0315451300 8536689009 3895830163 0746451241 9237693084 5622397898 7802506508 8304105859 8263333106 9137757731 8355131306 9306331740 8483173130 8157712584 7097314269 1948505170 2107959537 6003761941 0832427995 4295784758 3618336612 4578632294 6423256605 7929293512 7426946703 5581399251 9434391256 4824528048 7776139076 6983835602 6279474273 |
| 2617056 5440611604 0150107773 0628236908 6950247992 4626295278 4840475270 0524941026 2623581822 7001100126 3960930183 7486716537 4459283412 1724333489 |
| 136 5435653377 5645356972 9099641756 2235455584 3096836415 8595156069 9054676593 0316259049 |
| 1202164499 4958358778 4622411152 8740322383 8959554814 4820119388 4561129409 |
| 6119910404 8600759035 4385108236 8864716346 4122214154 8636298203 |
| 69070487 9430515450 7571236046 4615523099 5904005782 8793207033 |
| 645 0115797417 0309367057 6111973808 8376312298 5880380319 |
| 566450204 9947053765 2410523816 3561593320 8880914081 |
| 8 5814859008 5358944363 1767410583 0989754417 |
| 17093 0352946211 3151730844 0133088753 |
| 8992 5431630879 1323885434 0742549161 |
| 9774965160 9132387209 9940337813 |
| 2270749977 0063770394 3267896893 |
| 1050694407 9169924330 7322558769 |
| 193875572 8990763383 2763194193 |
| 3097543 6605498155 3209385377 |
| 50084 5298222757 2836958569 |
| 44773 6400177469 4409410529 |
| 16699 4787886920 7154025313 |
| 12106 3912936056 6798184993 |
| 1895 1126577055 1221591557 |
| 389 7407643148 2825787969 |
| 357 7032812906 9487449761 |
| 310 0306418895 8721577957 |
| 1 6175153340 4275739009 |
| 8715088910 4151789711 |
| 728476128 7152763009 |
| 148602024 6905046497 |
| 35226841 0538069173 |
| 21856931 1351547213 |
| 2705512 0371396113 |
| 1512427 5669554773 |
| 1485782 7018464473 |
| 1156049 4908734913 |
| 45400 7659884481 |
| 17182 2729767347 |
| 4210 5994979273 |
| 4071 1056368417 |
| 1409 6586228481 |
| 761 8630845169 |
| 327 7447258849 |
| 62 9290903249 |
| 31 4071573537 |
| 30 0071170649 |
| 12 4497184001 |
| 6 8278701187 |
| 3 3669873217 |
| 1 0406557081 |
| 8205377329 |
| 7500514657 |
| 1299819511 |
| 235498561 |
| 21307457 |
| 10296721 |
| 7920613 |
| 3485441 |
| 3192769 |
| 1952623 |
| 1508977 |
| 1292887 |
| 353473 |
| 261101 |
| 253153 |
| 98641 |
| 44269 |
| 24977 |
| 21313 |
| 13099 |
| 10501 |
| 10459 |
| 8821 |
| 2689 |
| 2083 |
| 2017 |
| 1627 |
| 1303 |
| 1153 |
| 1009 |
| 953 |
| 757 |
| 673 |
| 631 |
| 577 |
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.350793%
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 = 5 suffices.
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 ≡ 13 (mod 64) and therefore cannot be a square and N is prime.