[QUOTE=Puzzle-Peter;430728]I just submitted 2038*366^1028507-1 to the Top5000 pages. It will be ranked 22nd after verification :smile:[/QUOTE]

Nice one! 2,636,562 decimal digits! Congrats! :smile:

Very handsome find! 22nd! Outstanding! :whee:

[QUOTE=Puzzle-Peter;430728]I just submitted 2038*366^1028507-1 to the Top5000 pages. It will be ranked 22nd after verification :smile:[/QUOTE]

A huge congrats! :smile: This will be CRUS's largest prime!

One big side note about this monstrous find:

This is the largest prime EVER found whose base and exponent are not a power of 2! CRUS had the previous record for that category at 1.69M digits.

:banana::bow wave::party:

Really HUGE prime. Congratulations, Peter!

Puzzle-Peter,that is what I call prime :)
Congratulations!
:bow:

Thanks folks! :smile:

It looks that your prime stuck on verification. Even big one as yours, doubt it need more than three days on dual xeon server to verification :)

Many N+1 proofs need multiple runs (here, the base is highly composite).
It would be good to give Prof. Caldwell, The Prime Mogul, a buzz.

I did run the PRP test on 18-threaded P95 -- it took only 1.5 hours and validated. But that's of course not a N+1 test.

[QUOTE=pepi37;430982]It looks that your prime stuck on verification. Even big one as yours, doubt it need more than three days on dual xeon server to verification :)[/QUOTE]

It took a week to find it on a dual Xeon server due to the fact that it was running on one core only. I don't think the prime pages dedicate whole machines to one task?

[QUOTE=rebirther;428874][URL="http://primes.utm.edu/primes/page.php?id=121404"]82*821^139686+1[/URL] found by Mankka* (407095 digits)

The user misread the proofcode infos but contacted Chris to change it.

The base S821 is now a 1k and still running up to 200k.
[/QUOTE]

Reb,

I noticed that this proof code has never been changed. Can you check on it? Thanks.

Gary