Count in factors: Difference between revisions

→‎{{header|Wren}}: Now uses Wren-math module.
(Added Wren)
(→‎{{header|Wren}}: Now uses Wren-math module.)
Line 4,154:
 
=={{header|Wren}}==
{{libheader|Wren-math}}
<lang ecmascript>var primeFactors = Fn.new { |n|
<lang ecmascript>import "/math" for Int
if (n == 1) return [1]
 
var factors = []
for (r in [1..9, 2144..2154, 9987..9999]) {
while (n % 2 == 0) {
for (i in factors.add(2r) {
nvar factors = n(i > 1) ? Int.primeFactors(i) /: 2[1]
for (i in r) System.print("%(i): %(primeFactors.call(i)factors.join(" x "))")
}
var i = 3
var lim = n.sqrt.floor
while (i <= lim) {
while (n % i == 0) {
factors.add(i)
n = n / i
}
i = i + 2
}
if (n > 2) factors.add(n)
return factors
}
 
for (r in [1..9, 2144..2154, 9987..9999]) {
for (i in r) System.print("%(i): %(primeFactors.call(i).join(" x "))")
System.print()
}</lang>
9,482

edits