view problem3.py @ 14:49c96972949d default tip

#50 rewrite of solution
author Dominic Cleal <dominic@computerkb.co.uk>
date Mon, 01 Dec 2008 19:11:55 +0000
parents 0aeacd17f493
children
line wrap: on
line source

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))