Deceptive numbers: Difference between revisions
Content deleted Content added
m →{{header|Phix}}: limit |
→{{header|Wren}}: 600 x speedup by avoiding Wren's string repetition operator which is very inefficient for large n. |
||
Line 128:
{{libheader|Wren-gmp}}
{{libheader|Wren-math}}
An embedded program so we can use GMP. Takes
<lang ecmascript>/* deceptive_numbers.wren */
Line 137:
var limit = 25
var n = 25
var s = "1" * 24
var deceptive = []
while (count < limit) {
if (!Int.isPrime(n) && n % 3 != 0) {
var repunit = Mpz.fromStr(
if (repunit.isDivisibleUi(n)) {
deceptive.add(n)
Line 147 ⟶ 148:
}
n = n + 2
s = s + "11"
}
System.print("The first %(limit) deceptive numbers are:")
| |||