Primality Certificate for (2879^2851-1)/2878

Andy Steward9,859 digits06 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.

Factorizing N-1

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

From Factorisation
28792879
Φ22 · 2 · 2 · 2 · 2 · 2 · 3 · 3 · 5
Φ37 · 109 · 10867
Φ5401 · 171385139441
Φ63 · 199 · 13879
Φ105 · 11 · 31 · 40280184701
Φ1561 · 77348626951062943365875221
Φ1974177 · 591091 · 323302407726332123495683 · 13030716387995375974916631401
Φ25103001 · p65
Φ308191 · 1907094421 · 302256062363971
Φ38191 · 1217 · 3079 · 12503 · 40471 · 792871 · p39
Φ505 · 3251 · 7231658267590385201 · 26509818797682618751 · 491135887281071615526244501
Φ57125867106844710917552267252661327160663557219142485635251 · p69
Φ75151 · 64049544751 · 1891807500001 · 64703478559933587301 · p94
Φ9520934961 · 265950387415947888271 · 1375696405903113712794877952645326702511 · p183
Φ114255361 · p120
Φ15032251 · 410758492255814289151 · 33775813258769636193373105424658151 · 199257397432525847670251085155801797351 · p41
Φ190761 · 84121526873181166802209151656658842176589016401 · c200
Φ285571 · 992941 · 1047244600976881 · 112101872530521238928791021 · 275259574395288446533935963061 · c419
Φ475p1246
Φ5704561 · 35911 · 37549857511 · 2402162954339893049491 · c458
Φ9502851 · 3399578102598942585301 · 3342321421460552586969293951 · c1193
Φ142556502998195701 · 714629906249101 · 5659653347999481342751 · 4863797918402765462804401 · c2416
Φ285010203001 · 7443450451 · 73460511301 · 61142824498351 · 243006031430936263416001 · 1407396566912356180395112351 · c2399

We need the product F of all the prime factors from this partial factorization:

212324 1314053527 6137516929 8019536466 2020644402 1511062709 5457622366 4653712291 1067346240 2905842490 1698231264 0380261925 3058879903 7938118225 3248557742 7359717877 8603853175 3095132240 9313801060 1878055439 7799489226 8620094015 1605581022 7329191516 1767974318 3350168071 7663837836 1435275823 0538678164 2980380790 8755527430 2359702247 3996006130 2122676147 3369184025 4907628469 0854869734 0688125997 9763176025 6786724218 7849118630 6566260356 3950445777 5936885021 9986578777 4457574141 9885142676 1101627068 0375856997 0378776586 5816709279 1454173059 1393001706 4164222484 7733560603 2636194075 8348643964 0687858502 7408954071 7420958591 9012290713 5598672570 0526826463 5842022472 7512154662 2828588407 6557654832 3281066436 2769698526 2699889894 8434362177 3536533223 3237216368 7044385636 4942221009 5809902738 0640313288 5481231518 2422370394 0890071911 5360643178 0837423033 2311649988 6627664750 0742724761 2554044638 9619386019 7210616699 0026721385 7288750367 6840159725 7233387021 9327652505 3362914900 5064612124 6508386635 7335076187 9358394227 1481822739 5821245354 3246854592 7566755022 7197232362 3305343292 0944138687 7475333086 9531260655 6995601095 3653977298 7700619879 5853577379 7069701592 2451035203 4174996715 9787443330 4306752572 8576692731 1973810136 9009774218 4805738866 3295712777 3555640587 7641191497 4444050356 5425145601
151 7237645450 1318382816 3815701607 4374178578 3863438047 2394728223 0011591890 3605234937 4870641846 3229573719 3519585095 4212156057 1679288166 2726668357 6448368403 1611996282 1030542156 5007204881
1335660824 4212104732 8264283343 2451616980 6553939956 9962342803 1024783142 1885951997 0768362609 3653807366 2842471174 9798912001
1978 6502217921 4655548037 3223174825 1378047811 9692583773 4867649922 1628281538 7333546912 4348883701
270792611 5441445662 8137624540 1477064117 0225106484 8876808631 9954895611
14859 0777936351 5492285723 4147539790 0380203395 2179241924 0136356201
1258671 0684471091 7552267252 6613271606 6355721914 2485635251
8412152 6873181166 8022091516 5665884217 6589016401
2 6273418913 5134539594 8624137374 7462761501
1375696405 9031137127 9487795264 5326702511
642842839 0210706880 2605655872 0816147661
199257397 4325258476 7025108515 5801797351
33775 8132587696 3619337310 5424658151
2752595743 9528844653 3935963061
130307163 8799537597 4916631401
33423214 2146055258 6969293951
14073965 6691235618 0395112351
4911358 8728107161 5526244501
1121018 7253052123 8928791021
773486 2695106294 3365875221
48637 9791840276 5462804401
3233 0240772633 2123495683
2430 0603143093 6263416001
56 5965334799 9481342751
33 9957810259 8942585301
24 0216295433 9893049491
4 1075849225 5814289151
2 6595038741 5947888271
6470347855 9933587301
2650981879 7682618751
723165826 7590385201
104724 4600976881
71462 9906249101
30225 6062363971
6114 2824498351
5650 2998195701
189 1807500001
17 1385139441
7 3460511301
6 4049544751
4 0280184701
3 7549857511
7443450451
1907094421
20934961
10203001
992941
792871
591091
255361
103001
74177
40471
35911
32251
13879
12503
10867
8191
4561
3251
3079
2879
2851
1217
761
571
401
199
191
151
109
61
31
11
7
53
33
26

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) = 28.154825%

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 = 437 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.

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

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 ≡ 5 (mod 64) and therefore cannot be a square and this stage of the proof is passed.

Coppersmith and Howgrave-Graham

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:

Welcome to the CHG primality prover!
------------------------------------

Found values of n, F and G.
    Number to be tested has 9859 digits.
    Modulus has 2776 digits.
Modulus is 28.15482488% 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 = 8, u = 3. Right endpoint has 1532 digits.
    Running CHG with h = 8, u = 3. Right endpoint has 1437 digits.
    Running CHG with h = 7, u = 2. Right endpoint has 1300 digits.
    Running CHG with h = 7, u = 2. Right endpoint has 1242 digits.
    Running CHG with h = 7, u = 2. Right endpoint has 1125 digits.
    Running CHG with h = 6, u = 2. Right endpoint has 924 digits.
    Running CHG with h = 5, u = 1. Right endpoint has 733 digits.

Congratulations! n is prime!
A certificate has been saved to the file "2879_2851.out".
Goodbye!

The actual input file containing N and F and the output certificate are included in this file.