2 files changed, 122 insertions, 0 deletions
diff --git a/challenge-175/sgreen/python/ch-1.py b/challenge-175/sgreen/python/ch-1.py
new file mode 100755
index 0000000000..9c99981d3b
--- /dev/null
+++ b/challenge-175/sgreen/python/ch-1.py
@@ -0,0 +1,25 @@
+#!/usr/bin/env python3
+
+import sys
+from datetime import date, timedelta
+from dateutil.relativedelta import relativedelta
+
+
+def main(arg):
+    # Use the year provided or the current year if it wasn't
+    year = int(arg[0]) if len(arg) else date.today().year
+
+    for m in range(12):
+        # Get the last day of each month
+        dt = date(year, 1+m, 1) + relativedelta(months=1) - timedelta(days=1)
+
+        # Get the day of week (Monday is 1, Sunday is 7)
+        dow = dt.isoweekday()
+
+        # Take off the number of days to get last Sunday
+        last_sunday = dt-timedelta(days=dow % 7)
+        print(last_sunday.isoformat())
+
+
+if __name__ == '__main__':
+    main(sys.argv[1:])
diff --git a/challenge-175/sgreen/python/ch-2.py b/challenge-175/sgreen/python/ch-2.py
new file mode 100755
index 0000000000..a04379a679
--- /dev/null
+++ b/challenge-175/sgreen/python/ch-2.py
@@ -0,0 +1,97 @@
+#!/usr/bin/env python3
+
+import math
+
+primes = []
+factors = {}
+totients = {}
+
+
+def is_prime(number):
+    '''Return true or false if the number is a prime'''
+    if number < 2:
+        return False
+
+    for i in primes:
+        if number % i == 0:
+            return False
+
+    # It's a prime
+    return True
+
+
+def get_factors(num):
+    '''Get the prime factors that make up the numbers'''
+    global factors
+
+    if num not in factors:
+        factors[num] = set()
+
+        for p in primes:
+            if num % p == 0:
+                factors[num].add(p)
+
+    return factors[num]
+
+
+def get_totients(num):
+    '''Count the number of values between 1 and num-1 that has the gcd of 1'''
+    global totients
+
+    # If we've calculated this before, return the result
+    if num not in totients:
+        factors = get_factors(num)
+
+        count = 0
+        for n in range(1, num):
+            # Count this number if it has no common factors (other than 1)
+            if not factors.intersection(get_factors(n)):
+                count += 1
+
+        # Store the result when we need it again
+        totients[num] = count
+
+    return totients[num]
+
+
+def is_ptn(num):
+    '''Return whether this number is a perfect totient number'''
+
+    # Keep a count of the total
+    totals = 0
+
+    # Loop until we get to one
+    n = num
+    while n > 1:
+        totient = get_totients(n)
+        totals += totient
+
+        if totals > num:
+            # Short circuit exit if we know it will be False
+            return False
+
+        n = totient
+
+    return totals == num
+
+
+def main():
+    global primes
+    solutions = []
+    number = 0
+
+    # Loop until we have 20 solutions
+    while(len(solutions) < 20):
+        number += 1
+
+        if is_prime(number):
+            primes.append(number)
+
+        if is_ptn(number):
+            solutions.append(number)
+
+    print(*solutions, sep=', ')
+
+
+if __name__ == '__main__':
+    main()