Mersenne primes: Difference between revisions
Added 11l
(Added Fortran implementation.) |
Alextretyak (talk | contribs) (Added 11l) |
||
Line 12:
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.
<br><br>
=={{header|11l}}==
{{trans|D}}
<lang 11l>F is_prime(BigInt bi)
I bi < 2 {R 0B}
I bi % 2 == 0 {R bi == 2}
I bi % 3 == 0 {R bi == 3}
V test = BigInt(5)
L test * test < bi
I bi % test == 0
R 0B
test += 2
I bi % test == 0
R 0B
test += 4
R 1B
V base = BigInt(2)
L(p) 1..31
I is_prime(base - 1)
print(‘2 ^ ’p‘ - 1’)
base *= 2</lang>
{{out}}
<pre>
2 ^ 2 - 1
2 ^ 3 - 1
2 ^ 5 - 1
2 ^ 7 - 1
2 ^ 13 - 1
2 ^ 17 - 1
2 ^ 19 - 1
2 ^ 31 - 1
</pre>
=={{header|AppleScript}}==
| |||