Report top-5000 primes here

[pepi37]

Originally Posted by KEP

On March 28th at 09:44 local time, a dream came true

One of my Ryzen PC's found following prime:

104*383^408249+1

It is 1,054,591 digits and it enters at 449th largest prime

Congratulations!

[KEP]

Thanks guys

@Masser: There is 38 k's remaining, with k=2, 32 and 128 being tested to n=1M without a prime - this will be reflected in the update in approximately 3 weeks from now

[rebirther]

18922*111^383954+1 found by marmot (785315 digits)

[rebirther]

607*676^544517+1 found by 3DpNKyXhViXrNkzNVoTcy7VQKmKS (1540957 digits)


base S676 is proven

[masser]

Originally Posted by rebirther

607*676^544517+1 found by 3DpNKyXhViXrNkzNVoTcy7VQKmKS (1540957 digits)


base S676 is proven

Wow - congrats!

[gd_barnes]

Originally Posted by rebirther

607*676^544517+1 found by 3DpNKyXhViXrNkzNVoTcy7VQKmKS (1540957 digits)

base S676 is proven

[pepi37]

Originally Posted by rebirther

607*676^544517+1 found by 3DpNKyXhViXrNkzNVoTcy7VQKmKS (1540957 digits)


base S676 is proven

Well done!
Congratulations

[rogue]

1261*988^246031+1 is prime at 736807 digits, which is 3x longer than the previous prime for this conjecture. Continuing my search on this base.

[gd_barnes]

Originally Posted by rogue

1261*988^246031+1 is prime at 736807 digits, which is 3x longer than the previous prime for this conjecture. Continuing my search on this base.

Nice find!


Don't forget to include CRUS in your top-5000 submissions.

[rogue]

Originally Posted by gd_barnes

Nice find!

Don't forget to include CRUS in your top-5000 submissions.

I was going to create a new proof code, but wasn't clear how to add CRUS to it. If CRUS can be added to the code I used, that would be nice.

[gd_barnes]

Originally Posted by rogue

I was going to create a new proof code, but wasn't clear how to add CRUS to it. If CRUS can be added to the code I used, that would be nice.

You cannot add a project to an existing code. You will have to create a new code and have the prime transferred to it. To do this: (1) Create a code with all of the attributions of your current code plus CRUS as a project. (2) Email Prof. Caldwell at the top-5000 site to transfer the prime to it.

If you don't wish to do (2) I can take care of that part of it.

Here's a how to for creating a proof code with CRUS as the project: Start the process of creating a new proof code. When you get to this page:
https://primes.utm.edu/bios/newcode.php

In addition to clicking on Jeane Penne's LLR in the middle of the page type "srsieve,CRUS" (without quotes) in the box towards the bottom of the page. Then submit the proof code.

That should do it.