Anonymous user
Mersenne primes: Difference between revisions
Added Julia language
(Added Sidef) |
(Added Julia language) |
||
Line 85:
2 ^ 19 - 1
2 ^ 31 - 1</pre>
=={{header|Julia}}==
{{works with|Julia|0.6}}
Julia module <code>Primes</code> uses Miller-Rabin primality test.
<lang julia>using Primes
mersenne(n::Integer) = convert(typeof(n), 2) ^ n - one(n)
function main(nmax::Integer)
n = ith = zero(nmax)
while ith ≤ nmax
if isprime(mersenne(n))
println("M$n")
ith += 1
end
n += 1
end
end
main(big(20))</lang>
{{out}}
<pre>M2
M3
M5
M7
M13
M17
M19
M31
M61
M89
M107
M127
M521
M607
M1279
M2203
M2281
M3217
M4253
M4423
M9689</pre>
=={{header|Kotlin}}==
| |||