Primality Certificate for (5701^2161-1)/5700

Andy Steward8,113 digits26 January 2001
Originally by David Broadhurst 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.

Factorizing N-1

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

From Factorisation
57015701
Φ22 · 2851
Φ33 · 10835701
Φ42 · 29 · 53 · 97 · 109
Φ55 · 11 · 271 · 3541 · 20018081
Φ67 · 277 · 16759
Φ82 · 528170533481401
Φ93 · 42643 · 78520177 · 3417873391
Φ101056155808971401
Φ1213 · 81973 · 991265449
Φ1531 · 9415702741 · 3822237858141239731
Φ162 · 17 · 8881121 · 18940417 · 195106656918529
Φ1837 · 268921 · 3450482303799313
Φ2041 · 61 · 701 · 47041 · 61141 · 221292921284221
Φ2473 · 457 · 33447931709244560113835041
Φ273 · 3511 · p64
Φ30p31
Φ3632941 · 757297 · p35
Φ40254878321221288694645684061441 · p31
Φ451245763105371991 · p76
Φ481153 · p58
Φ54487 · 2053 · p62
Φ60241 · 8161 · 247689282961 · 22054087867358041141 · 115893727821572598150301
Φ72937 · 402697 · p82
Φ8078401 · 9975281 · p109
Φ90631 · 13591 · 34471 · 76070062042497369181 · p59
Φ1083673 · 147097 · 71904358435714173631117 · c104
Φ1201801 · 8567761 · 1393660201 · 9668165401 · 4577486878898881 · 1070743038222079681 · 1870566084630529681 · p39
Φ13518855378923851 · c258
Φ1443313 · 5806573124113 · 24197730162109529329 · 204752900667537463383937 · c122
Φ180181 · 856081 · 147653751237065641 · 81519126969689127882001 · p133
Φ216433 · 433 · 427681 · 95779396513 · 38978973604533926367793 · p226
Φ240c241
Φ270855288982407179071 · c253
Φ36016921 · 29881 · 24027198929198281 · p336
Φ432285635809 · 122696989968968929 · c516
Φ540541 · 8969457781 · 4305816588421 · 255270821686561 · p502
Φ7202161 · 77041 · 8577059574241 · 66127647585880081 · 385257858729483601 · 2324733053850264115929601 · c642
Φ108030241 · 91801 · 130681 · 5844961 · 18390160081 · c1051
Φ216019441 · 43201 · c2155

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 :

13 4874468602 4775994340 6154431785 9382183646 2024691331 4312197647 7122703045 4874420217 4390326659 2141762959 1527760513 7397596734 8748449462 4325945717 9119526135 3774527827 4876041308 1774312880 4653180656 7399938367 3430157226 3347190312 1096309757 1221659828 7143210294 6999823053 8824991248 3638613755 0686889818 4751168680 3698758454 7365892633 7561319233 4672721209 7605436474 4807359328 8299983475 5432145720 3420865142 4361444241 2408080824 1675237341 7482257934 5130132825 0042082497 7601984518 4587975772 8359462660 2992004049 0540177101
306743 6911921615 5147358489 9345643759 5442052593 6344832165 2211010473 1715478465 1466199866 5594850901 0149437825 5985157746 9653814894 5635432051 2981896621 2945394811 4113175925 5794360804 9898737089 7289479371 3694736152 3477514065 7641315287 1626391228 8232546690 4150705704 9012632418 3790711386 4827067511 9194015421 8078667628 5524135600 6050371737 3212769321
895935 4219662230 6187402297 3417803517 0398154765 8225813947 1226056644 1238983273 5664333858 2258363788 2373343784 6263689109 6404769931 4011051530 1024779333 8301386783 4264166953 2345674542 8545107899 2310858672 0547326629 6268242543 9817196321
103 5029028136 0040382024 0873515933 1266326153 4687737191 7892990746 9888596504 5792680672 4762673045 0653671925 3695190148 7247216615 6357846101
198237846 6559150536 1309342104 4820140816 8517568309 1042570513 5098610556 4640902465 6323989633 7695466468 0127819921
36 8219682323 3045703394 2836266244 7059785430 0306783854 1505934904 8824985181 2349901409
111529 4394605782 4296266424 4364451916 3152910334 0890684888 2271963817 6759711511
3842 0822149182 1130812243 2222334120 9823493227 1573628957 5256663891
40 4763019908 0978275739 4726201097 2909720838 9994839574 7434463591
617840764 8962876467 1053092330 6582554508 1777101156 4505612131
10799094 6786936736 3327109908 8888216628 9722704554 3239602017
813328260 9952476934 5907073261 1766162201
47250 8338038066 8635372365 5852154013
4 8852158570 6905355484 4931169761
1 1160521796 9692789680 5542722801
2548783212 2128869464 5684061441
334479 3170924456 0113835041
23247 3305385026 4115929601
2047 5290066753 7463383937
1158 9372782157 2598150301
815 1912696968 9127882001
719 0435843571 4173631117
389 7897360453 3926367793
7607006204 2497369181
2419773016 2109529329
2205408786 7358041141
382223785 8141239731
187056608 4630529681
107074303 8222079681
85528898 2407179071
38525785 8729483601
14765375 1237065641
12269698 9968968929
6612764 7585880081
2402719 8929198281
457748 6878898881
345048 2303799313
124576 3105371991
105615 5808971401
52817 0533481401
25527 0821686561
22129 2921284221
19510 6656918529
1885 5378923851
857 7059574241
580 6573124113
430 5816588421
24 7689282961
9 5779396513
1 8390160081
9668165401
9415702741
8969457781
3417873391
1393660201
991265449
285635809
78520177
20018081
18940417
10835701
9975281
8881121
8567761
5844961
856081
757297
427681
402697
268921
147097
130681
91801
81973
78401
77041
61141
47041
43201
42643
34471
32941
30241
29881
19441
16921
16759
13591
8161
5701
3673
3541
3511
3313

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.351218%

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 = 19 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 ≡ 13 (mod 64) and therefore cannot be a square and N is prime.