Ultra useful primes: Difference between revisions
Added Wren
SqrtNegInf (talk | contribs) (Added Perl) |
(Added Wren) |
||
Line 61:
<pre>1 3 5 15 5 59 159 189 569 105
1557 2549 2439</pre>
=={{header|Wren}}==
{{libheader|Wren-gmp}}
An embedded version as Wren-CLI (with BigInt) will be very slow for this task.
The following takes about 17.5 seconds to get to n = 13 but 7 minutes 15 seconds to reach n = 14. I didn't bother after that.
<lang ecmascript>import "./gmp" for Mpz
import "./fmt" for Fmt
var a = Fn.new { |n|
var p = Mpz.one.lsh(1 << n)
var k = 1
while (true) {
var q = p - k
if (q.probPrime(15) > 0) return k
k = k + 2
}
}
System.print(" n k")
System.print("----------")
for (n in 1..14) Fmt.print("$2d $d", n, a.call(n))</lang>
{{out}}
<pre>
n k
----------
1 1
2 3
3 5
4 15
5 5
6 59
7 159
8 189
9 569
10 105
11 1557
12 2549
13 2439
14 13797
</pre>
| |||