def main(factors = {}):
for num in xrange(11,21):
current_factors = prime.factorization(num)
print "Currently we have:", factors
print num,"has the factors:",current_factors
for key in current_factors.keys():
if key not in factors: factors[key] = current_factors[key]
elif factors[key] < current_factors[key]: factors[key] = current_factors[key]
results = [a**b for a,b in zip(factors.keys(), factors.values())]
return reduce(lambda k,x: k*x, results, 1)
def num_of_divisors(num): return reduce(lambda k,y: k*y, [k+1 for k in prime.factorization(num).values()]) def main(index = 100):
def main(n = 600851475143):
return max(prime.factorization(n).keys())
