Category talk:Wren-gmp: Difference between revisions

if (n < 1) return []

if (n is Num) n = from(n)

var divs = []

var divs2 = []

var i = one

var k = n.isEven ? one : two

var sqrt = n.copy().sqrt

while (i <= sqrt) {

if (n.isDivisible(i)) {

divs.add(i.copy())

var j = n / i

if (j != i) divs2.add(j)

}

i.add(k)

}

if (!divs2.isEmpty) divs = divs + divs2[-1..0]

return divs

}

// Returns all the divisors of 'n' excluding 'n'.

static properDivisors(n) {

var d = divisors(n)

var c = d.count

return (c <= 1) ? [] : d[0..-2]

}

// As 'divisors' method but uses a different algorithm.

// Better for large numbers with a small number of prime factors.

static divisors2(n) {

if (n <= zero) return []

var factors = primeFactors(n)

var divs = [one]

// As 'properDivisors' but uses 'divisors2' method.

static properDivisors2(n) {

var d = divisors2(n)