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 11:37, 12 January 2022
, 2 years ago→{{header|Wren}}: Slightly more efficient.
(Added Wren) |
(→{{header|Wren}}: Slightly more efficient.) |
||
Line 38:
An embedded version as, judging by the size of numbers involved, Wren-CLI (using BigInt) will be too slow for this.
Brute force approach - takes a smidge
<lang ecmascript>import "./gmp" for Mpz
Line 45:
if (k == 1) return false
for (m in 1...k) {
var n =
if (n.probPrime(15) > 0) return false
}
| |||