Smallest number k such that k+2^m is composite for all m less than k: Difference between revisions
Content deleted Content added
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
}
|