n
.factorize(n)
n
.n
in ascending order,
each one as often as its multiplicity requires, such that
n == prod(factorize(n))
.isPrime, Primes
factorize(1002001) # 7 7 11 11 13 13
factorize(65537) # is prime
# Euler's calculation
factorize(2^32 + 1) # 641 6700417
Run the code above in your browser using DataLab