Problem 3
#!/usr/bin/python
def prime(n, start):
factors = []
while (n % start != 0):
start = start + 1
factors.append(start)
if n > start:
factors.extend(prime(n/start, start))
return factors
print max(prime(600851475143, 71))
[...] in the light of how short some of my colleagues code is (see Chris’s python solution on his blog) although this erlang effort still performs well for numbers 3 orders of magnitude [...]
Euler Problem 3 at Faffing round the edges
8 Nov 08 at 11:40 am