Ultra useful primes: Difference between revisions

Added Sidef
(Added Sidef)
Line 231:
<pre>1 3 5 15 5 59 159 189 569 105
1557 2549 2439</pre>
 
=={{header|Sidef}}==
<lang ruby>say(" n k")
say("----------")
 
for n in (1..13) {
var t = 2**(2**n)
printf("%2d %d\n", n, {|k| t - k -> is_prob_prime }.first)
}</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
</pre>
(takes ~20 seconds)
 
=={{header|Wren}}==
2,747

edits