@@ -0,0 +1,226 @@
+def largest_prime_factor(n, h):%0A    for i in xrange(2, n+1):%0A        d, m = divmod(n, i)%0A        if m == 0:%0A            largest_prime_factor(d, i)%0A            break%0A    if n == 1: print h%0Alargest_prime_factor(600851475143, 0)%0A

Add python implementation for problem 3