Ultra useful primes: Difference between revisions
m
→{{header|Wren}}: Changed to Wren S/H
Basicgames (talk | contribs) |
m (→{{header|Wren}}: Changed to Wren S/H) |
||
| (One intermediate revision by one other user not shown) | |||
Line 426:
<pre>1 3 5 15 5 59 159 189 569 105
1557 2549 2439</pre>
=={{header|Python}}==
<syntaxhighlight lang="python>
# useful.py by xing216
from gmpy2 import is_prime
def useful(n):
k = 1
is_useful = False
while is_useful == False:
if is_prime(2**(2**n) - k):
is_useful = True
break
k += 2
return k
if __name__ == "__main__":
print("n | k")
for i in range(1,14):
print(f"{i:<4}{useful(i)}")
</syntaxhighlight>
{{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>
=={{header|Ring}}==
<syntaxhighlight lang="ring">
Line 571 ⟶ 605:
{{libheader|Wren-fmt}}
Manages to find the first ten but takes 84 seconds to do so.
<syntaxhighlight lang="
import "./fmt" for Fmt
Line 609 ⟶ 643:
{{libheader|Wren-gmp}}
The following takes about 17 seconds to get to n = 13 but 7 minutes 10 seconds to reach n = 14. I didn't bother after that.
<syntaxhighlight lang="
import "./fmt" for Fmt
| |||