Project Notes

This program factors numbers into their prime factors. It uses a list of primes and divides the test number by each prime to see if it is divisible. If it is, it puts the prime in the list, divides the test # by that prime, and keeps going. With the amount of primes I have in the (invisible) list, all numbers less that 400 million should be able to be factored by this project. To imput a number, simply start typing. The 'C' key will clear everything. Enjoy!