2 files changed, 70 insertions, 0 deletions
diff --git a/challenge-172/sgreen/python/ch-1.py b/challenge-172/sgreen/python/ch-1.py
new file mode 100755
index 0000000000..125ec64815
--- /dev/null
+++ b/challenge-172/sgreen/python/ch-1.py
@@ -0,0 +1,36 @@
+#!/usr/bin/env python
+
+import sys
+import math
+from itertools import combinations
+
+
+def is_prime(number):
+    '''Return true or false if the number is a prime'''
+    if number < 2:
+        return False
+
+    for i in range(2, int(math.sqrt(number)) + 1):
+        if number % i == 0:
+            return False
+
+    # It's a prime
+    return True
+
+
+def main(m, n):
+    # Retrieve a list of all prime numbers <= m
+    primes = [x for x in range(m, 1, -1) if is_prime(x)]
+
+    # Go through each combination of n length, and see if we have a solution
+    for l in combinations(primes, n):
+        if sum(l) == m:
+            print(l, sep=', ')
+            return
+
+    # It is possible that no solution is found
+    print('No solution!')
+
+
+if __name__ == '__main__':
+    main(int(sys.argv[1]), int(sys.argv[2]))
diff --git a/challenge-172/sgreen/python/ch-2.py b/challenge-172/sgreen/python/ch-2.py
new file mode 100755
index 0000000000..c9162d1604
--- /dev/null
+++ b/challenge-172/sgreen/python/ch-2.py
@@ -0,0 +1,34 @@
+#!/usr/bin/env python
+
+import sys
+
+
+def get_value(l, quart):
+    # Calculate the position of the value we require
+    pos = (len(l)-1) * quart / 100
+    i = int(pos)
+
+    if i == pos:
+        # It is a single value
+        return l[i]
+
+    # We need the average of two numbers
+    val = (l[i] + l[i+1]) / 2
+    return int(val) if int(val) == val else val
+
+
+def main(l):
+
+    # Sort the list
+    l = sorted([int(x) for x in l])
+    solution = []
+
+    # Calculate the five values
+    for quart in range(0, 101, 25):
+        solution.append(get_value(l, quart))
+
+    print(*solution, sep=', ')
+
+
+if __name__ == '__main__':
+    main(sys.argv[1:])