p014.hs

{-
  Problem:

  The following iterative sequence is defined for the set of positive integers:

  n → n/2 (n is even)
  n → 3n + 1 (n is odd)

  Using the rule above and starting with 13, we generate the following sequence:

  13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1
  It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. Although it has not been proved yet (Collatz Problem), it is thought that all starting numbers finish at 1.

  Which starting number, under one million, produces the longest chain?

  NOTE: Once the chain starts the terms are allowed to go above one million.

  Answer: 837799
-}

collatz :: Int -> [Int]
collatz 1 = [1]
collatz n
  | even n     = n : collatz (n `div` 2)
  | otherwise  = n : collatz (3*n + 1)

findMaxChainHead :: [[Int]] -> Int
findMaxChainHead = head . foldr (\acc xs -> if (length acc) >= (length xs) then acc else xs) []

main :: IO ()
main = do
  print $ "The starting number, under one million, that produces the longest Collatz chain is: "
  print $ findMaxChainHead [collatz $ x | x <- [1..1000000]]