"P587124"

This prime's information:

Description: (from blob table id=391)

This Prime is obtained by iteration of the following PARI/GP code: k = [1, 1, 1, 2, 5, 9, 6, 79, 16, 219, 580, 387, 189, 7067, 1803, 6582, 31917, 18888, 20973, 132755, 11419]; q = 2; for(i=1, #k, q = k[i] * (q - 1) * q + 1); print("n",q,"n"); Every Prime in these iterations (including the P587124) are verified to be prime via PFGW using " - tc" flag and then added to the helper file to prove the primality of the next iteration. Every prime q in these iterations can be proven via N - 1 method since all the prime factors of q - 1 are known

User comments about this prime (disclaimer):

User comments are allowed to convey mathematical information about this number, how it was proven prime.... See our guidelines and restrictions.

Serge Batalov writes (2 Dec 2020):  (report abuse)

A fast way to prove automatically is to: gp -q k = [1, 1, 1, 2, 5, 9, 6, 79, 16, 219, 580, 387, 189, 7067, 1803, 6582, 31917, 18888, 20973, 132755, 11419]; q = 2; for(i=1, #k, q = k[i] * (q - 1) * q + 1; write("seq",q)) The file 'seq' will be its own N-1 helper. Then, run pfgw -hseq -t -l -N seq

Verification data:

The Top 5000 Primes is a list for proven primes only. In order to maintain the integrity of this list, we seek to verify the primality of all submissions.  We are currently unable to check all proofs (ECPP, KP, ...), but we will at least trial divide and PRP check every entry before it is included in the list.