Category talk:Wren-math: Difference between revisions
→Source code: Added Int.primePowers method.
(→Source code: Added Int.distinctPrimeFactors method.) |
(→Source code: Added Int.primePowers method.) |
||
Line 716:
}
return factors
}
// Returns a list of the distinct prime factors of 'n' together with the number
// of times each such factor is repeated.
static primePowers(n) {
var factors = primeFactors(n)
if (factors.count == 0) return []
var prev = factors[0]
var res = [[prev, 1]]
for (f in factors.skip(1)) {
if (f == prev) {
res[-1][1] = res[-1][1] + 1
} else {
res.add([f, 1])
}
prev = f
}
return res
}
| |||