From 93ea7fe5957b62f18e8fbd17a21696bd7de6332d Mon Sep 17 00:00:00 2001
From: mjfernez <mjfernez@gmail.com>
Date: Sun, 9 Feb 2020 15:16:26 -0500
Subject: Organized everything, update README

---
 14-Longest-Collatz-Sequence/collatz.py | 28 ++++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)
 create mode 100644 14-Longest-Collatz-Sequence/collatz.py

(limited to '14-Longest-Collatz-Sequence/collatz.py')

diff --git a/14-Longest-Collatz-Sequence/collatz.py b/14-Longest-Collatz-Sequence/collatz.py
new file mode 100644
index 0000000..74d5e1e
--- /dev/null
+++ b/14-Longest-Collatz-Sequence/collatz.py
@@ -0,0 +1,28 @@
+import PIL
+import math
+
+# Problem 14 Longest Collatz sequence
+# Note, a little slow, takes about 15 seconds.
+# There is probably a more efficient solution out there
+chain = []
+biggo = []
+
+
+def collatz(seed):
+    chain.append(seed)
+    if(seed == 1):
+        return 0
+    if(seed % 2 == 0):
+        seed = seed/2
+    else:
+        seed = 3*seed + 1
+    collatz(seed)
+
+
+for n in range(1, pow(10, 6)):
+    collatz(n)
+    if(len(chain) > len(biggo)):
+        biggo = chain
+    chain = []
+print(biggo)
+print("Has " + str(len(biggo)) + " numbers.")
-- 
cgit v1.2.3