From 42c8b5f771693f165903ea19247df0b12a689bfe Mon Sep 17 00:00:00 2001
From: JellyWX <judewrs@gmail.com>
Date: Wed, 21 Jun 2017 21:20:47 +0100
Subject: [PATCH] solutions 7 8 9

---
 problem6.py | 12 ++++++++++++
 problem7.py | 15 +++++++++++++++
 problem8.py | 13 +++++++++++++
 problem9.py | 15 +++++++++++++++
 4 files changed, 55 insertions(+)
 create mode 100644 problem6.py
 create mode 100644 problem7.py
 create mode 100644 problem8.py
 create mode 100644 problem9.py

diff --git a/problem6.py b/problem6.py
new file mode 100644
index 0000000..7a22f04
--- /dev/null
+++ b/problem6.py
@@ -0,0 +1,12 @@
+sum_sq = 0
+sq_sum = 0
+
+for i in range(101):
+  sum_sq += i**2
+  sq_sum += i
+
+sq_sum *= sq_sum
+
+diff = sq_sum - sum_sq
+
+print(diff)
diff --git a/problem7.py b/problem7.py
new file mode 100644
index 0000000..7d3acdd
--- /dev/null
+++ b/problem7.py
@@ -0,0 +1,15 @@
+primes = [2,3,5,7,11,13]
+num = 15
+
+while len(primes) < 10001:
+  prime = True
+  for p in primes:
+    if num % p == 0:
+      prime = False
+      break
+  if prime:
+    primes.append(num)
+
+  num += 2
+
+print(primes)
diff --git a/problem8.py b/problem8.py
new file mode 100644
index 0000000..f8ebcb3
--- /dev/null
+++ b/problem8.py
@@ -0,0 +1,13 @@
+number = list('7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450')
+highest_value = 0
+
+
+for i in range(len(number) - 13):
+  product = 1
+  for j in range(13):
+    product *= int(number[i+j])
+    print(product)
+  if product > highest_value:
+    highest_value = product
+
+print(highest_value)
diff --git a/problem9.py b/problem9.py
new file mode 100644
index 0000000..127fd00
--- /dev/null
+++ b/problem9.py
@@ -0,0 +1,15 @@
+from math import sqrt
+
+def main():
+  a = 1
+  b = 1
+  c = 1
+
+  for c in range(1000):
+    for b in range(c):
+      for a in range(b):
+        if a + b + c == 1000:
+          if sqrt(a**2 + b**2) == c:
+            print(str(a) + ' ' + str(b) + ' ' + str(c))
+            print(a*b*c)
+            return