Finds all prime factors of the given integer. All resulting factors multiplied together will equal the number you entered. (EXAMPLE: 10000 has 2 small prime factors, 10530437 has 2 large prime factors.)

A prime number, by definition, cannot be factored by any other number than 1 and itself. Any integer that is NOT prime, therefore, MUST be a product of two or more prime numbers. Finding those prime factors is what this program sets out to accomplish.

Finding the set of prime numbers to use as divisors is a separate problem of its own. We have done this in advance and saved the list of prime numbers to a text file, which is read into the program when executed.