Smallest number k such that k+2^m is composite for all m less than k: Difference between revisions
Smallest number k such that k+2^m is composite for all m less than k (view source)
Revision as of 20:48, 16 May 2023
, 1 year agoCreated Nim solution.
(→{{header|Ruby}}: Add Ruby) |
(Created Nim solution.) |
||
Line 104:
{{out}}
<pre>{773, 2131, 2491, 4471, 5101, 7013, 8543, 10711}</pre>
=={{header|Nim}}==
{{trans|Wren}}
{{libheader|Nim-Integers}}
<syntaxhighlight lang="Nim">import integers
let One = newInteger(1)
proc a(k: Positive): bool =
## Return true if "k" is a sequence member, false otherwise.
if k == 1: return false
for m in 1..<k:
if isPrime(One shl m + k):
return false
result = true
var count = 0
var k = 1
while count < 5:
if a(k):
stdout.write k, ' '
inc count
inc k, 2
echo()
</syntaxhighlight>
{{out}}
<pre>773 2131 2491 4471 5101
</pre>
=={{header|Perl}}==
| |||