Duffinian numbers: Difference between revisions
→{{header|Wren}}: Now uses Fmt.tprint and new Int.divisorSum method - 3 times faster than before.
(→{{header|Wren}}: Now uses Fmt.tprint and new Int.divisorSum method - 3 times faster than before.) |
|||
Line 1,030:
{{libheader|Wren-seq}}
{{libheader|Wren-fmt}}
<syntaxhighlight lang="ecmascript">import "./math" for Int
import "./seq" for Lst
import "./fmt" for Fmt
Line 1,043:
continue
}
var sigmaSum =
if (Int.gcd(sigmaSum, i) != 1) d[i] = false
}
Line 1,049:
var duff = (1...d.count).where { |i| d[i] }.toList
System.print("First 50 Duffinian numbers:")
var triplets = []
Line 1,056:
}
System.print("\nFirst 50 Duffinian triplets:")
{{out}}
| |||