Challenges

Challenge.hs~

@@ -25,4 +25,4 @@ solve i j = (i, j, (cycleLength i j))
               | k `mod` 2 == 0  
                   = (cycleLength n (k `div` 2)) + 1
               | otherwise 
-                  = (cycleLength (n (k * 3) + 1)) + 1
+                  = (cycleLength n ((k * 3) + 1)) + 1