Finds the prime factors of a number using Fermat's factorization method. Here's what it does: 1. Find the first square that's greater than the input number 'N', and call its square root 'A'. 2. 'B' is the square root of A squared minus N. 3. If B isn't an integer (whole number), add one to A and compute B again. Keep doing this until B is an integer. 4. Two factors of N are: A + B (Sprite1 outa) A - B (Sprite1 outb) If one of those factors is the same as N, it's prime and we're done. Otherwise go through the same process with each factor. Since Fermat's method only works when the input is odd and not a perfect square, the first step is to divide it by 2 as many times as possible (adding 2 to the factorList each time) and then take the square root as many times as possible. This is not the fastest method out there, especially when working with numbers that contain large primes, but it's pretty straight-forward. On my computer, 100061 takes a few seconds, and 1000061 takes a few minutes.
