Jump to content

Category talk:Wren-math: Difference between revisions

m
→‎Source code: No need for Int qualifier.
(→‎Source code: Improved algorithm for Int.divisors2.)
m (→‎Source code: No need for Int qualifier.)
Line 634:
// Better for larger numbers.
static divisors2(n) {
var pf = Int.primeFactors(n)
if (pf.count == 0) return (n == 1) ? [1] : pf
var arr = []
9,485

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.