Pollard's p-1 algorithm is useful in finding the prime factors of a number n, though it may be necessary to run the algorithm multiple times to reduce all factors to primes. Please choose a reasonable bound; values with too many digits could cause the algorithm to stall.