Anonymous user
Mersenne primes: Difference between revisions
added ;Task: section header, updated the lastest date of know Mersenne primes, added some URLs for references on Mersenne primes.
(added ;Task: section header, updated the lastest date of know Mersenne primes, added some URLs for references on Mersenne primes.) |
|||
Line 1:
{{draft task|Prime Numbers}}
;Task:
Create code that will list (preferably calculate) all of the ''Mersenne primes'' until some limitation is reached. ▼
▲Create code that will list (preferably calculate) all of the Mersenne primes until some limitation is reached.
The number of ''known'' Mersenne primes is '''51''' (as of
;Also see:
* the Wikipedia entry: [https://en.wikipedia.org/wiki/Mersenne_prime Mersenne prime].
▲The number of ''known'' Mersenne primes is '''51''' (as of December, 2018), and the largest known Mersenne prime contains contains '''24,862,048''' decimal digits.
* the MathWorld entry; [https://mathworld.wolfram.com/MersennePrime.html Mersenne prime].
* For a list of all the know Mersenne primes: [https://primes.utm.edu/mersenne/index.html#known list of Mersenne
* For a general website about primes: [https://primes.utm.edu/ prime pages].
* the MathWorld entry: [https://mathworld.wolfram.com/MersennePrime.html Mersenne prime].
* the OEIS entry: [https://oeis.org/wiki/Mersenne_primes Mersenne primes].
* the OEIS entry: [https://oeis.org/A000043 A000043 Mersenne exponents: primes p such that 2^p - 1 is prime. Then 2^p - 1 is called a Mersenne prime].
<br><br>
| |||