Add Efficient Prime Checking

Implemented a more efficient way to check for primes. Rather than
checking if every factor is a prime number, it generates a list of
primes (by checking if each new number up to a certain point is
divisible by any primes), and then checks whether all the factors of
600851475143L are within the list of primes.
Add Only Check Odd Numbers for Prime

This increases efficiency.