Week 5 · The longest chain

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.*

From the two solutions below, choose the best solution and explain how it can be improved.

Solution A

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

Solution B

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

| |

Log in to accept this challenge

Submitted by others

looks like problem 14 on project euler. dunno which one's better lol, dont wanna spoil it.

Also python http://stackoverflow.com/questions/37177690/solving-longest-collatz-sequence-with-numpy

Solution B. How can it be improved? Use a purer language like Haskell: https://wiki.haskell.org/Euler_problems/11_to_20#Problem_14