feat(solution): problem #10

solutions/008/largestproductinaseries.py

@@ -0,0 +1,12 @@
+bigNumberString = str(7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450)
+biggestProduct = 0
+numberOfAdjacentDigits = 13
+
+for i in range(0, len(bigNumberString) - numberOfAdjacentDigits):
+    currentProduct = int(bigNumberString[i])
+    for j in range(1, numberOfAdjacentDigits):
+        currentProduct *= int(bigNumberString[i+j])
+    if currentProduct > biggestProduct:
+        biggestProduct = currentProduct
+
+print("The greatest product of thirteen adjacent digits is: " + str(biggestProduct))

solutions/009/specialpythagoreantriplet.py

@@ -0,0 +1,23 @@
+def is_pythagorean_triplet(a, b, c):
+    if (a * a + b * b) == (c * c):
+        return True
+    else:
+        return False
+
+tripletFound = False
+
+for i in range(1,500):
+    for j in range(1,500):
+        for k in range(1,500):
+            if is_pythagorean_triplet(i, j, k):
+                print("triplet:",i,j,k)
+                if i+j+k == 1000:
+                    print("The product of abc is: " + str(i*j*k))
+                    tripletFound = True
+            if tripletFound:
+                break
+        if tripletFound:
+            break
+    if tripletFound:
+        break
+

solutions/010/summationofprimes.py

@@ -0,0 +1,18 @@
+import math
+
+primeSum = 0
+currentNumber = 1
+limit = 2000000
+
+def is_prime(maybeprime):
+    for i in range(2, math.floor(math.sqrt(maybeprime) + 1)):
+        if maybeprime % i == 0:
+            return False
+    return True
+
+while currentNumber < limit:
+    currentNumber += 1
+    if is_prime(currentNumber):
+        primeSum += currentNumber
+
+print("The sum of all primes below two million is: " + str(primeSum))