Compute the prime factorization(s) of integer(s) n.

Usage

Factorize(n)

Value

A named list of the same length as n,
each element a 2-column matrix with column "p" the prime
factors and column~"m" their respective exponents (or
multiplities), i.e., for a prime number n, the resulting matrix
is cbind(p = n, m = 1).

Arguments

n

vector of integers to factorize.

Author

Martin Maechler, Jan. 1996.

Details

works via Primes, currently in a cheap way, sub-optimal
for large composite \(n\).

See Also

GCD, LCM, Primes, IsPrime, Divisors

For factorization of moderately or really large numbers, see the gmp
package, and its factorize() (which is ~20x faster!).