def find():
n = 1
while True:
n += 1
if all(4 == len(set(primefactors(n + i))) for i in range(4)):
print n
break
def find():
n = 1
while True:
n += 1
if all(4==len(set(primefactors(n+i))) for i in range(4)):
print n
break
def pe(x):
d = DefaultDict(1) # set it to 1 so we don't have to map(+1) later
for i in primefactors(x): d[i] += 1
return d.values()
#!/usr/bin/env python # Copyright (c) 2008 by Steingrim Dovland <*****@*****.**> from euler import primefactors # The prime factors of 13195 are 5, 7, 13 and 29. # # What is the largest prime factor of the number 600851475143 print max(primefactors(600851475143))
from euler import primefactors print max(primefactors(600851475143))
