Please report all top-5000 primes in this thread.

Instructions for submitting a top-5000 prime:

Step 1: For people who have not submitted top-5000 primes previously, create a prover account:

1. Go to

https://primes.utm.edu/bios/newprover.php.

2. Fill out the form and submit it. You will be assigned a prover account.

Step 2: Create a proof code:

1. Go to

https://primes.utm.edu/bios/newcode.php.

2. Type in your name that you created in step 1 in the space provided.

3. In the list of proof programs, select the program that you used to PROVE the prime (not a probable prime). Usually it will be Jean Penne's LLR or OpenPFGW.

4. In the space below all of the proof programs that says "none", type in 'CRUS' for the project, your sieving software (srsieve for team drives), and other software that helped find the prime. Separate each selection by a comma. (Note if you used LLR to find a probable prime and then PFGW to prove the prime, select OpenPFGW in the selection list and then type in LLR as additional software at the bottom. Each program will get full credit.)

5. You should now have a new proof code and can submit the prime. Example...L442.

Step 3: Submit the prime:

1. Go to

https://primes.utm.edu/bios/index.php.

2. Next to 'search for proof-code', type your new code from step 2 and press enter.

3. Towards the bottom, next to 'Submit primes using this code as', click on your name (prover account) and press enter.

4. You should see a big free-form box. Type in your prime (no spaces needed) and click 'Press here to submit these prime(s)'.

5. If necessary in the little pop-up box, type in your user name (prover account) and password and press enter.

6. A verification screen will come up. If the prime is correct, click 'Press here to complete submission'.

Suggestion: I suggest attempting to "normalize" or "reduce" your prime as much as possible before submitting although it is not necessary. The top-5000 site will do this automatically with its 'canonization' process but it will give you a strange message that is difficult to comprehend. A normalization or reduction can be done all of the time if the base is a power of 2 or the k-value is a multiple of the base after reducing the base as much as possible. Example:

13438*16^98815+1

13438*2^395260+1

6719*2^395261+1

Gary