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 12:30, 6 February 2024
, 4 months ago→{{header|Wren}}: Changed to Wren S/H
m (Renamed a method.) |
m (→{{header|Wren}}: Changed to Wren S/H) |
||
Line 248:
Brute force approach - takes a smidge under 2 seconds.
<syntaxhighlight lang="
// returns true if k is a sequence member, false otherwise
| |||