Prime Factorization of Integers
Compute the prime factorization(s) of integer(s) n
.
factorize(n, verbose = FALSE)
n |
vector of integers to factorize. |
verbose |
logical indicating if some progress information should be printed. |
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.
factorize(47) factorize(seq(101, 120, by=2))
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.