Computes the prime factorization of a given number. A number is prime if and only if the number is a positive integer with exactly one positive divisor other than 1.
c = factor(a)
Number you want to factor. a is a positive integer. a has an upper limit of 232-1.
Set of prime numbers whose product equals a. c is a row vector of primes. The factors in c might repeat. For example, factor(16) returns the vector [2, 2, 2, 2].
C = factor(1000001)
Where This Node Can Run:
Desktop OS: Windows
FPGA: Not supported