Complete Problem Solution

Fully optimized using a method I ran across on StackOverflow. I gets rid
of the need for checking primeness. Very fast. Divides the number by
it's smallest factors until all that's left is the largest factor, which
is always a prime number, since you've already divided out all smaller
numbers. It uses the concept that all non-prime numbers are the products
of primes.