0

The program uses an implementation of the Sieve of Eratosthenes to generate a small list of prime numbers which is subsequently used for direct comparison to find the prime factors for any whole number up to and including 478939.

This limitation is due to the primitive method used to generate prime numbers, but it is adequate for doing homework problems for adding fractions etc..