And another, proving [url]http://factorization.ath.cx/index.php?id=1100000000838212513[/url] (389 digits) should enable a N-1 proof for (21467^239-1)/21466 [url]http://factorization.ath.cx/index.php?id=1100000000828692633[/url] (1031 digits).

Chris

And another, proving [url]http://factorization.ath.cx/index.php?id=1100000000838217320[/url] (588 digits) will enable a N-1 proof of (13859^293-1)/13858 [url]http://factorization.ath.cx/index.php?id=1100000000835633881[/url] (1210 digits). It appeared after I added the algebraic factors of (13859^293-1)/13858-1.

Chris

Yet again, proving [url]http://factorization.ath.cx/index.php?id=1100000000838217452[/url] (600 digits) will enable a N-1 proof for (15749^293-1)/15748 [url]http://factorization.ath.cx/index.php?id=1100000000835634053[/url] 1226 digits. Same as the last one.

Chris

Proving [URL]http://factordb.com/index.php?id=1100000000840065507[/URL] (475 digits) will enable a N+1 proof that (10^249+2049)*(10^249+2048)+1 [URL]http://factordb.com/index.php?id=1100000000839451026[/URL] (499 digits) is prime.

Chris

PS. Proving ((10^249+3360)*(10^249+3359)+2)/492158 [url]http://factordb.com/index.php?id=1100000000839452482[/url] (493 digits) will enable a N+1 proof that (10^249+3360)*(10^249+3359)+1 [url]http://factordb.com/index.php?id=1100000000839452258[/url] (499 digits) is prime.

Proving (451^541-541^451)/187563763576710 [url]http://factordb.com/index.php?id=1100000000842957564[/url] (1422 digits) will enable a N-1 proof that (451^541-541^451)*2+1 [url]http://factordb.com/index.php?id=1100000000820140578[/url] (1437 digits) is prime.

Chris

Proving (684^431+1)/2740371955 [url]http://factordb.com/index.php?id=1100000000872469596[/url] (1213 digits) prime will enable a N-1 proof that (684^863+1)/685 [url]http://factordb.com/index.php?id=1100000000872469699[/url] (2444 digits) is prime.

Chris

Another, proving ((3^1015+10^150)/(3^203+10^30)+1)/73731780242 [url]http://factordb.com/index.php?id=1100000000884772922[/url] (377 digits) will enable a N+1 proof that (3^1015+10^150)/(3^203+10^30) [url]http://factordb.com/index.php?id=1100000000884772837[/url] (388 digits) is prime.

((3^1015+10^150)/(3^203+10^30)+1)/73731780242 appears to have been added to factordb when I asked for primality information on (3^1015+10^150)/(3^203+10^30).

Chris

After adding algebraic factors to (844^647+1)/845-1 I found that proving [url]http://factordb.com/index.php?id=1100000000889589833[/url] prime will enable a N-1 proof that [url]http://factordb.com/index.php?id=1100000000889446338[/url] (844^647+1)/845 is prime.

Chris

[QUOTE=chris2be8;449881]After adding algebraic factors to (844^647+1)/845-1 I found that proving [url]http://factordb.com/index.php?id=1100000000889589833[/url] prime will enable a N-1 proof that [url]http://factordb.com/index.php?id=1100000000889446338[/url] (844^647+1)/845 is prime.

Chris[/QUOTE]Ooops...I proved the wrong one! :blush:

Back here again, proving (1217^109+4)/19504986581519868149481 [url]http://factordb.com/index.php?id=1100000000936916098[/url] will enable a N-1 proof that (1217^218*2-1)/31 [url]http://factordb.com/index.php?id=1100000000936596506[/url] is prime.

Chris

Someone has added a load of PRPs like (117124925581^29-1)/117124925580 to factordb. So I've adapted my script for adding missing algebraic factors to add algebraic factors for N-1 then prove such PRPs by N-1 if possible.

It takes about 10 seconds per PRP (varying with how fast factordb responds). So I should have cleared out most of them in a few hours. It misses some where the algebraic factors need proving prime (if there's a backlog of numbers to prove prime) or factoring (if below 70 digits). But a second run should catch them.

That should cut down the number of PRPs needing certificates generating.

Chris