# coleifer/project-euler

### Subversion checkout URL

You can clone with
or
.

Added a few more of the early ones.

1 parent 526933d commit 5ecc8fae944fec17b5cbaf2a152f3cb90908ecab committed
6 problem01.py
 @@ -0,0 +1,6 @@ +s = 0 +for i in range(1, 1000): + if i % 3 == 0 or i % 5 == 0: + s += i + +print s
7 problem02.py
 @@ -0,0 +1,7 @@ +a, b, s = 1, 0, 0 +while s < 4000000: + a, b = a+b, a + if a % 2 == 0: + s += a + +print s
21 problem03.py
 @@ -0,0 +1,21 @@ +import math + +def is_prime(n): + if n < 0: + return False + for j in range(2, math.sqrt(n)+1): + if n%j == 0: + return False + return True + +big = 600851475143 + +i = 1 + +while i*i <= big: + i += 2 + if big % i == 0: + if is_prime(i): + maximum = i + +print maximum
19 problem07.py
 @@ -0,0 +1,19 @@ +import math + +def is_prime(n): + if n < 0: + return False + for j in range(2, math.sqrt(n)+1): + if n%j == 0: + return False + return True + +primes = [] +i = 1 + +while len(primes) <= 10000: + i += 1 + if is_prime(i): + primes.append(i) + +print i
32 problem08.py
 @@ -0,0 +1,32 @@ +num = """73167176531330624919225119674426574742355349194934 +96983520312774506326239578318016984801869478851843 +85861560789112949495459501737958331952853208805511 +12540698747158523863050715693290963295227443043557 +66896648950445244523161731856403098711121722383113 +62229893423380308135336276614282806444486645238749 +30358907296290491560440772390713810515859307960866 +70172427121883998797908792274921901699720888093776 +65727333001053367881220235421809751254540594752243 +52584907711670556013604839586446706324415722155397 +53697817977846174064955149290862569321978468622482 +83972241375657056057490261407972968652414535100474 +82166370484403199890008895243450658541227588666881 +16427171479924442928230863465674813919123162824586 +17866458359124566529476545682848912883142607690042 +24219022671055626321111109370544217506941658960408 +07198403850962455444362981230987879927244284909188 +84580156166097919133875499200524063689912560717606 +05886116467109405077541002256983155200055935729725 +71636269561882670428252483600823257530420752963450""" + +num = num.replace("\n", "") + +maximum = 0 +for i in range(len(num) - 5): + prod = 1 + for j in range(5): + prod *= int(num[i+j]) + if prod > maximum: + maximum = prod + +print maximum