# HG changeset patch
# User Dominic Cleal <dominic@computerkb.co.uk>
# Date 1228136843 0
# Node ID 0aeacd17f4938179b67e25b0c951195a25a6f178
# Parent  449e1d2e103cb89f2868fcca76327c664476aef6
#3 solution

diff -r 449e1d2e103c -r 0aeacd17f493 problem3.py
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/problem3.py	Mon Dec 01 13:07:23 2008 +0000
@@ -0,0 +1,17 @@
+import primes
+
+def find(f):
+	factors = []
+	t = 1
+	s = primes.sieve()
+	for p in s.sieve():
+		if f % p == 0:
+			if not p in factors:
+				factors.append(p)
+				print "Factor found: %d" % (p)
+				t *= p
+				if t == f:
+					return factors
+
+print "Factors: %s" % (find(600851475143))
+