Mersenne primes: Difference between revisions
→{{header|Wren}}: Replaced existing solution with one which uses BigInt.
(→{{header|Wren}}: Replaced existing solution with one which uses BigInt.) |
|||
Line 1,400:
=={{header|Wren}}==
{{libheader|Wren-math}}
{{libheader|Wren-big}}
A bit slow so limited to first 14 Mersenne primes.
<lang ecmascript>import "/math" for Int
import "/big" for BigInt
var MAX = 14
System.print("The
var p = 2
if (Int.isPrime(m)) {▼
while (true) {
var sp = (i < 10) ? " " : ""▼
var m =
if (m.isProbablePrime(10)) {
System.print("2 ^ %(p) - 1")
count = count + 1
if (count == MAX) break
}
while (true) {
}
}</lang>
Line 1,414 ⟶ 1,424:
{{out}}
<pre>
The
2 ^ 61 - 1
2 ^ 89 - 1
2 ^ 107 - 1
2 ^ 127 - 1
2 ^ 521 - 1
2 ^ 607 - 1
</pre>
| |||