Back

Factorize

Finds factors and prime factors of numbers (must be a positive integer).

Input:

Number of prime factors:

Prime factorization:

Number of distinct prime factors:

Prime factorization (exponential):

Number of factors:

All factors:

Technical Comment

This program finds factors using Pollard's rho algorithm. It has a time complexity of O(n^(1/4)), which is faster than the standard method of trial division. In practice, this program can factor all numbers up to 10²⁴ in a second.