Yak Shaving » euler

Problem 4

channam — Wed, 05 Nov 2008 23:49:17 +0000

#!/usr/bin/python

winners = []

for a in range (100, 999):
    for b in range (100, 999):
        test = str(a * b)
        if test == test[::-1]:
            winners.append(int(test))

print max(winners)

Problem 3

channam — Wed, 05 Nov 2008 23:48:35 +0000

#!/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))

Problem 2

channam — Wed, 05 Nov 2008 23:48:04 +0000

#!/usr/bin/python

counter = 0

def fib(n):
    result = 0
    a, b = 0, 1
    for i in range(n):
        a, b = b, a + b
	if a < 4000000:
            if a%2 == 0:
                result += a
        else:
            return result

print fib(100000)

Problem 1

channam — Wed, 05 Nov 2008 23:44:46 +0000

#!/usr/bin/python

result = 0

for i in range (1, 1000):
	if i % 3 == 0 or i % 5 == 0:
		result += i 

print result