first commit

Author: victortrac

problem-001.py

@@ -0,0 +1,9 @@
+#!/bin/python
+
+total = 0
+
+for x in range(1,1000):
+  if (x % 3) == 0 or (x % 5) == 0 :
+    total += x
+
+print total

problem-002.py

@@ -0,0 +1,23 @@
+#!/bin/python
+
+x = 1
+y = 2
+
+def fib (x,y,max) :
+  seq = [x,y]
+  while (x and y) < max :
+    seq.append(x+y)
+    x = seq[len(seq)-2]
+    y = seq[len(seq)-1]
+  return seq
+
+result = fib(1,2,4000000)
+
+sum = 0
+
+for x in result:
+  if (x < 4000000) and (x % 2 == 0):
+    print x
+    sum += x
+
+print sum

problem-003.py

@@ -0,0 +1,15 @@
+#!/bin/python
+
+def prime_factor(num, primes = []) :
+  divider = 2
+  while (num >= 3) :
+    if ((num % divider) == 0) :
+      num = num / divider
+      primes.append(divider)
+      prime_factor(num, primes)
+      break
+    else : divider += 1
+  return primes
+
+result = prime_factor(600851475143)
+print result

problem-004.py

@@ -0,0 +1,15 @@
+#!/usr/bin/python
+
+def check_palin(z):
+    f = list(str(z))
+    r = f[::-1]
+    return (f == r)
+
+palins = []
+
+for x in range(1,1000) :
+    for y in range(1,1000) :
+        if (check_palin(x*y)): palins.append(x*y)
+            
+palins.sort()
+print palins[-1]

problem-005.py

@@ -0,0 +1,42 @@
+#!/bin/python
+
+def get_primes(x,y):
+    primes = []
+    for i in range(x,y+1):
+        if isprime(i):
+            primes.append(i)
+    return primes
+        
+def isprime(n):
+    n = abs(int(n))
+    if n < 2:
+        return False
+    if n == 2:
+        return True
+    if not n & 1:
+        return False
+    for i in range(3, int(n**.5)+1, 2) :
+        if (n % i) == 0:
+            return False
+    return True
+
+def multiply(list):
+    list.sort()
+    primes = get_primes(list[0],list[-1])
+    num = 1
+    for i in primes: num *= i
+    found = False
+    while (found == False):
+#        print "Trying ", num
+        for n in list[::-1]:
+            remainder = num % n
+            if remainder == 0:
+                if (int(n) == int(list[0])): 
+                    found = True
+            else:
+                print num, n, remainder
+                num += +20
+                break
+    return num
+
+print multiply(range(1,21))

problem-006.py

@@ -0,0 +1,15 @@
+#!/usr/bin/python
+
+def sum_squares(x,y):
+    sum = 0
+    for i in range(x,y+1):
+        sum += i*i
+    return sum
+
+def square_sum(x,y):
+    sum = 0
+    for i in range(x,y+1):
+        sum += i
+    return sum*sum
+
+print square_sum(1,100) - sum_squares(1,100)

problem-007.py

@@ -0,0 +1,24 @@
+#!/usr/bin/python
+
+def isprime(n):
+    n = abs(int(n))
+    if n < 2:
+        return False
+    if n == 2:
+        return True
+    if not n & 1:
+        return False
+    for i in range(3, int(n**.5)+1, 2) :
+        if (n % i) == 0:
+            return False
+    return True
+
+primes = [2,3,5,7]
+
+n = 11
+
+while (len(primes) != 10001):
+    if (isprime(n)): primes.append(n)
+    n += 2
+    
+print primes[-1]

problem-008.py

@@ -0,0 +1,39 @@
+#!/usr/bin/env python
+
+number="""73167176531330624919225119674426574742355349194934
+96983520312774506326239578318016984801869478851843
+85861560789112949495459501737958331952853208805511
+12540698747158523863050715693290963295227443043557
+66896648950445244523161731856403098711121722383113
+62229893423380308135336276614282806444486645238749
+30358907296290491560440772390713810515859307960866
+70172427121883998797908792274921901699720888093776
+65727333001053367881220235421809751254540594752243
+52584907711670556013604839586446706324415722155397
+53697817977846174064955149290862569321978468622482
+83972241375657056057490261407972968652414535100474
+82166370484403199890008895243450658541227588666881
+16427171479924442928230863465674813919123162824586
+17866458359124566529476545682848912883142607690042
+24219022671055626321111109370544217506941658960408
+07198403850962455444362981230987879927244284909188
+84580156166097919133875499200524063689912560717606
+05886116467109405077541002256983155200055935729725
+71636269561882670428252483600823257530420752963450"""
+
+number = number.replace("\n","")
+
+list = []
+
+for i in number:
+    list.append(int(i))
+
+results = []
+
+for i in range(0,len(list)-5):
+    product = list[i] * list[i+1]
+    for j in range(2,5):
+        product = product * list[i+j]
+    results.append(product)
+
+print max(results)

problem-009.py

@@ -0,0 +1,13 @@
+#!/usr/bin/env python
+
+a = 1
+b = 2
+c = 3
+
+while a < 997:
+    for b in range(a, 1000-c):
+        c = 1000-b-a
+        if (a**2 + b**2) == c**2:
+            print a, b, c
+            print "product a*b*c", a*b*c
+    a += 1

problem-010.py

@@ -0,0 +1,27 @@
+#!/usr/bin/env python
+
+def isprime(n):
+    n = abs(int(n))
+    if n < 2:
+        return False
+    if n == 2:
+        return True
+    if not n & 1:
+        return False
+    for i in range(3, int(n**.5)+1, 2) :
+        if (n % i) == 0:
+            return False
+    return True
+
+primes = [2]
+
+for i in range(1,2000000,2):
+    if isprime(i):
+        primes.append(i)
+
+sum = 0
+
+for j in primes:
+    sum += j
+
+print sum

problem-011.py

@@ -0,0 +1,61 @@
+#!/usr/bin/env python
+
+grid =[
+        [8,2,22,97,38,15,0,40,0,75,4,5,7,78,52,12,50,77,91,8],
+        [49,49,99,40,17,81,18,57,60,87,17,40,98,43,69,48,4,56,62,0],
+        [81,49,31,73,55,79,14,29,93,71,40,67,53,88,30,3,49,13,36,65],
+        [52,70,95,23,4,60,11,42,69,24,68,56,1,32,56,71,37,2,36,91],
+        [22,31,16,71,51,67,63,89,41,92,36,54,22,40,40,28,66,33,13,80],
+        [24,47,32,60,99,3,45,2,44,75,33,53,78,36,84,20,35,17,12,50],
+        [32,98,81,28,64,23,67,10,26,38,40,67,59,54,70,66,18,38,64,70],
+        [67,26,20,68,2,62,12,20,95,63,94,39,63,8,40,91,66,49,94,21],
+        [24,55,58,5,66,73,99,26,97,17,78,78,96,83,14,88,34,89,63,72],
+        [21,36,23,9,75,0,76,44,20,45,35,14,0,61,33,97,34,31,33,95],
+        [78,17,53,28,22,75,31,67,15,94,3,80,4,62,16,14,9,53,56,92],
+        [16,39,5,42,96,35,31,47,55,58,88,24,0,17,54,24,36,29,85,57],
+        [86,56,0,48,35,71,89,7,5,44,44,37,44,60,21,58,51,54,17,58],
+        [19,80,81,68,5,94,47,69,28,73,92,13,86,52,17,77,4,89,55,40],
+        [4,52,8,83,97,35,99,16,7,97,57,32,16,26,26,79,33,27,98,66],
+        [88,36,68,87,57,62,20,72,3,46,33,67,46,55,12,32,63,93,53,69],
+        [4,42,16,73,38,25,39,11,24,94,72,18,8,46,29,32,40,62,76,36],
+        [20,69,36,41,72,30,23,88,34,62,99,69,82,67,59,85,74,4,36,16],
+        [20,73,35,29,78,31,90,1,74,31,49,71,48,86,81,16,23,57,5,54],
+        [1,70,54,71,83,51,54,69,16,92,33,48,61,43,52,1,89,19,67,48],
+    ]
+
+maxProduct = 0
+for y in range(0,len(grid)-3):
+    for x in range(0,len(grid[y])):
+        print "Row ", y, "Col ", x
+        temp = []
+        if x < (len(grid[y])-3):
+            temp.append(grid[y][x] * grid[y][x+1] * grid[y][x+2] * grid[y][x+3])
+            print "ProductRight", grid[y][x] , grid[y][x+1] , grid[y][x+2] , grid[y][x+3]
+        
+            temp.append(grid[y][x] * grid[y+1][x+1] * grid[y+2][x+2] * grid[y+3][x+3])
+            print "ProductDiag", grid[y][x] , grid[y+1][x+1] , grid[y+2][x+2] , grid[y+3][x+3]
+        
+        temp.append(grid[y][x] * grid[y+1][x] * grid[y+2][x] * grid[y+3][x])
+        print "ProductDown", grid[y][x] , grid[y+1][x] , grid[y+2][x] , grid[y+3][x]
+
+        if x >= 3:
+            temp.append(grid[y][x] * grid[y+1][x-1] * grid[y+2][x-2] * grid[y+3][x-3])
+            print "ProductDiagL", grid[y][x] , grid[y+1][x-1] , grid[y+2][x-2] , grid[y+3][x-3]
+
+        biggest = max(temp)
+    
+        if biggest > maxProduct:
+            maxProduct = biggest
+
+        
+for y in range(len(grid)-3, len(grid)):
+    for x in range(0,len(grid[y])):
+        print "Row ", y, "Col ", x
+        if x < (len(grid[y])-3):
+            productRight = grid[y][x] * grid[y][x+1] * grid[y][x+2] * grid[y][x+3]
+            print "ProductRight", grid[y][x] , grid[y][x+1] , grid[y][x+2] , grid[y][x+3]
+        
+        if productRight > maxProduct:
+            maxProduct = biggest
+    
+print maxProduct

problem-012.py

@@ -0,0 +1,25 @@
+#!/usr/bin/env python
+
+def triangle(n):
+    i = [1]
+    for x in range(2,n+1):
+        i.append(x + i[len(i)-1])
+    return i[-1]
+
+def factor(n):
+    i = [1,n]
+    for x in range(2,n/2):
+        if (n%x == 0) and x not in i:
+            i.append(x)
+            i.append(n/x)
+    i.sort()
+    return i
+
+n = 1
+while True:
+    tri = triangle(n)
+    if len(factor(tri)) < 500:
+        n += 1
+    else:
+        print tri
+        break