[QUOTE=Jayder;400766]I'd like to try this one if no one else has started on it.[/QUOTE]

Just post here to say you're reserving it, then start work on it.

Chris

I've started on it but it will take a while for my computer.

Proving [url]http://www.factordb.com/index.php?id=1100000000776692927[/url] (PRP2295) will enable N-1 proof of [url]http://www.factordb.com/index.php?id=1100000000629141624[/url] (1841^1841-1840)

[QUOTE=axn;401004]Proving [url]http://www.factordb.com/index.php?id=1100000000776692927[/url] (PRP2295) will enable N-1 proof of [url]http://www.factordb.com/index.php?id=1100000000629141624[/url] (1841^1841-1840)[/QUOTE]

I've started on it. Shouldn't take more than a couple of hours.

[QUOTE=Mini-Geek;401010]I've started on it. Shouldn't take more than a couple of hours.[/QUOTE]

Cool. And proven :smile:

[URL="http://factordb.com/index.php?id=1100000000777031801&open=prime"](20060^8377-1)/20059[/URL] proven after proving [URL="http://factordb.com/index.php?id=1100000000777031810&open=prime"]the helper Phi()[/URL].

Proving [url]http://factordb.com/index.php?id=1100000000741122407[/url] and [url]http://factordb.com/index.php?id=1100000000777430525[/url] (both 3267 digits) will enable a N-1 proof for [url]http://factordb.com/index.php?id=1100000000213113194[/url] 2^63583-7 (19141 digits).

The first PRP has been in factordb since January, the second was added when I added the algebraic factors of 2^63583-7 so I can't be sure it's prime.

Chris

[url]http://www.factordb.com/index.php?id=1100000000670082934[/url] (141^1471+1)/142-1 can be N-1 proved if a PRP688 ([url]http://www.factordb.com/index.php?id=1100000000777431067[/url]) can be proved.

[QUOTE=chris2be8;401732]The first PRP has been in factordb since January, the second was added when I added the algebraic factors of 2^63583-7 so I can't be sure it's prime.
[/QUOTE]

It isn't. Factordb has a PRP check option (under the primality section) where you can test with different bases.

EDIT:- Actually, neither of them are.

[QUOTE=axn;401738]It isn't. Factordb has a PRP check option (under the primality section) where you can test with different bases.

[/QUOTE]

I'll have to try that next time I find an interesting PRP. About how long would it take for a number this size and how many bases do I need to try to be reasonably sure it's prime?

Chris

[QUOTE=chris2be8;401756]I'll have to try that next time I find an interesting PRP. About how long would it take for a number this size and how many bases do I need to try to be reasonably sure it's prime?

Chris[/QUOTE]
Less than a minute, I think. Something in that area.
Define "reasonably".