[QUOTE=Puzzle-Peter;396997]I think the maximum number of tests you can start at once is 999, maybe that helps reducing the amount of manual work.[/QUOTE]

The problem with that is that someone else could also download and process PRPs and I would not recognize (thus computing a certificate that is not needed). I refined my scripts to automatically download and upload the inputs and certificates to factordb. So the only manual intervention is loading the input files in primo and executing the scripts.

I'm currently at PRP575 and 100 of those need around 30 minutes right now.

Here is a nice prime - [URL="http://factordb.com/index.php?query=%28%282%5E64163*9069%2B1%29%5E7%2B1%29%2F%282%5E64163*9069%2B2%29"]Phi[SUB]14[/SUB](9069*2^64163+1)[/URL].
It needs a helper (9069*2^64163+1 is a known prime) and is proven by N-1 33.34% factored.

This entry is so wrong! - [URL="http://factordb.com/index.php?query=%282%5E169690*33218925%29%5E2-1"](2^169690*33218925)^2-1[/URL]
:max:

[QUOTE=Batalov;397652]This entry is so wrong! - [URL="http://factordb.com/index.php?query=%282%5E169690*33218925%29%5E2-1"](2^169690*33218925)^2-1[/URL]
:max:[/QUOTE]

:davieddy:

Under "More Information" section, both the algebraic factors are listed as well.

So Bill Gates was on to something when he wanted to factor prime numbers, huh!

Yeah, its official

[url]http://www.factordb.com/index.php?id=1100000000764142938[/url]
:no:

After adding algebraic factors to (2^19774*13-1)/27+1 I found that proving [url]http://factorization.ath.cx/index.php?id=1100000000764200821[/url] prime would enable a N+1 proof for (2^19774*13-1)/27 ([url]http://factorization.ath.cx/index.php?id=1100000000349840249[/url]).

Chris

And here's another pair:
Proving ((10^2933*54+10^5867-1)/9-1)/10 ([url]http://factorization.ath.cx/index.php?id=1100000000271892643[/url]) would enable a proof of (10^2933*54+10^5867-1)/9 ([url]http://factorization.ath.cx/index.php?id=1000000000020252957[/url]). But they are nearly the same size.

The first looks as if it should have algebraic factors. But I could not find any.

Chris

[QUOTE=chris2be8;397757]After adding algebraic factors to (2^19774*13-1)/27+1 I found that proving [url]http://factorization.ath.cx/index.php?id=1100000000764200821[/url] prime would enable a N+1 proof for (2^19774*13-1)/27 ([url]http://factorization.ath.cx/index.php?id=1100000000349840249[/url]).

Chris[/QUOTE]

For [url=http://factorization.ath.cx/index.php?id=1100000000764200821]PRP3658[/url] I get: [QUOTE="primo"]The candidate is not a Lucas strong pseudoprime for (P=1,Q=-1)[/QUOTE] there seem to be some factors missing for (2^19773+1)

Very odd. I'm sure it showed as PRP when I posted the message.But I havn't saved a screen shot of it so I can't prove it.

Chris.

Edit. Checking under more information [url]http://factorization.ath.cx/index.php?id=1100000000764200821[/url] was created between March 15, 2015, 10:46 am and March 15, 2015, 11:50 am which was when I was adding the algebraic factors. I think it first showed red (ie unknown status), then purple (PRP). But only Syd could tell for sure, and he has more important issues to fix.

[QUOTE=chris2be8;397781]Very odd. I'm sure it showed as PRP when I posted the message.But I havn't saved a screen shot of it so I can't prove it.[/QUOTE]
I saw it as a PRP too, that's why I loaded it into Primo. Now it's flagged as Composite.