Create prob3-largest_prime_factor.py

initial draft.  
Tried to make it more efficient by only checking primes, by testing for primes using prime list, by reducing the size of the initial number by dividing by the prime, and by stopping when there is no possibility of finding a larger prime that goes in evenly.  
Solution passes Project Euler website check.