[QUOTE=gd_barnes;431055]Reb,

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

Gary[/QUOTE]

ok, I have asked the user again. I dont know why Chris doesnt changed anything yet.

[URL="http://primes.utm.edu/primes/page.php?id=121536"]12*68^656921+1[/URL] found by cpuid (1203815 digits)

This makes the S68 to a 1k, base is still running, I have tried to contact the user 3 times but no respond so I have reported it by myself. Cant beat the digits from Puzzle Peter but this one was the largest prime ever found by SRBase :)
[URL="http://primes.utm.edu/primes/page.php?id=121536"][/URL]

[QUOTE=rebirther;431109][URL="http://primes.utm.edu/primes/page.php?id=121536"]12*68^656921+1[/URL] found by cpuid (1203815 digits)

This makes the S68 to a 1k, base is still running, I have tried to contact the user 3 times but no respond so I have reported it by myself. Cant beat the digits from Puzzle Peter but this one was the largest prime ever found by SRBase :)
[/QUOTE]

A big congrats to SRBase! :smile:

S68 was way overdue for a prime. The last one was at n=3947.

[QUOTE=rebirther;431109][URL="http://primes.utm.edu/primes/page.php?id=121536"]12*68^656921+1[/URL] found by cpuid (1203815 digits)

This makes the S68 to a 1k, base is still running, I have tried to contact the user 3 times but no respond so I have reported it by myself. Cant beat the digits from Puzzle Peter but this one was the largest prime ever found by SRBase :)
[URL="http://primes.utm.edu/primes/page.php?id=121536"][/URL][/QUOTE]

Congrats Reb. Really nice to see that SRBase actually has some users that hare able/willing to push these megaprime bases towards a proof :smile:

Now go ahead and prove S68 :wink: :smile:

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

[URL="http://primes.utm.edu/primes/page.php?id=121517"]2038*366^1028507-1 is prime! (473550.9774s+0.0912s)
[Elapsed time: 5.48 days][/URL]

:retina:

Congrats to Peter on the verification finally ending making him immortal. :smile:

Congrats also to BOINC for another big one. :tu:

The non-base 2 numbers really do take a lot of time. So R366 is officially a 1ker now :smile:

That means I am "only" one prime away from my goal of doing one conjecture start to finish (except for working out the conjectured k of course).

[QUOTE=Puzzle-Peter;431191]That means I am "only" one prime away from my goal of doing one conjecture start to finish (except for working out the conjectured k of course).[/QUOTE]

And that would be very cool indeed. I really don't see how anyone else will be able to do a full elimination of a base by themself, from n=1 to n=proof :smile:

Congratulation on your find. Now go ahead and find yourself a Top10 prime and end the ruling of GIMPS :wink:

Take care :smile:

[QUOTE=KEP;431219]And that would be very cool indeed. I really don't see how anyone else will be able to do a full elimination of a base by themself, from n=1 to n=proof :smile:[/QUOTE]

Well, in the beginning people did it all the time. With conjectures that could be proven at n<1000 it wasn't really that bad. I started too late for any of these though.

[QUOTE=KEP;431219]
Congratulation on your find. Now go ahead and find yourself a Top10 prime and end the ruling of GIMPS :wink:[/QUOTE]

Thanks! Not too long ago I allowed myself to dream about the TOP10. In the meantime they are way too big. 10th place has more than 6.3M digits, over 1.5 times more than 11th place...

[QUOTE=Puzzle-Peter;431231]In the meantime they are way too big. 10th place has more than 6.3M digits, over 1.5 times more than 11th place...[/QUOTE]

Yeah, sure that is too big for a single individual. Let's hope you can prove S366 with a smaller prime than Top10 prime. Maybe in the future, srbase can challenge the ruling of GIMPs :smile:

[URL="http://primes.utm.edu/primes/page.php?id=121575"]766*33^610412+1[/URL] found by nenym (926923 digits)

The user missed the time to respond so I have reported it by myself again. This find solves the base S33 :)