euler/e003.py

def pfactor(n):
    i = 2
    while (n % i != 0 and i < n):
        i = i + 1
    if i == n:
        return [n]
    p = pfactor(n // i)
    p.append(i)
    return sorted(p, reverse=True)

print 'Prime factors of 600851475143:'
print pfactor(600851475143)
Renamed prime factor function git-svn-id: file:///srv/svn/euler@34 e5f4c3ec-3c0c-11df-b522-21efaa4426b5 2010-04-12 15:53:13 +00:00			`def pfactor(n):`
Problem 003 git-svn-id: file:///srv/svn/euler@20 e5f4c3ec-3c0c-11df-b522-21efaa4426b5 2010-04-12 15:53:00 +00:00			`i = 2`
			`while (n % i != 0 and i < n):`
			`i = i + 1`
			`if i == n:`
			`return [n]`
Renamed prime factor function git-svn-id: file:///srv/svn/euler@34 e5f4c3ec-3c0c-11df-b522-21efaa4426b5 2010-04-12 15:53:13 +00:00			`p = pfactor(n // i)`
Problem 003 git-svn-id: file:///srv/svn/euler@20 e5f4c3ec-3c0c-11df-b522-21efaa4426b5 2010-04-12 15:53:00 +00:00			`p.append(i)`
			`return sorted(p, reverse=True)`

			`print 'Prime factors of 600851475143:'`
Renamed prime factor function git-svn-id: file:///srv/svn/euler@34 e5f4c3ec-3c0c-11df-b522-21efaa4426b5 2010-04-12 15:53:13 +00:00			`print pfactor(600851475143)`