Prime Factorization of Integers
Compute the prime factorization(s) of integer(s) n.
Factorize(n)
n |
vector of integers to factorize. |
works via Primes, currently in a cheap way, sub-optimal
for large composite n.
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).
Martin Maechler, Jan. 1996.
For factorization of moderately or really large numbers, see the gmp
package, and its factorize() (which is ~20x faster!).
Factorize(47) Factorize(seq(101, 120, by=2))
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.