Problem 42673. Longest Collatz Sequence
Inspired by Projet Euler n°14.
The Collatz iterative sequence (See Cody problem n° 2103 and 211) 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 number given in input, produces the longest chain?
Be smart because numbers can be big...
Solution Stats
Problem Comments
-
1 Comment
Please try to solve a harder version "Problem 44448. Project Euler: Problem 14 Longest Collatz sequence"
https://ww2.mathworks.cn/matlabcentral/cody/problems/44448
Solution Comments
Show commentsProblem Recent Solvers102
Suggested Problems
-
5911 Solvers
-
Get the area codes from a list of phone numbers
1055 Solvers
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
479 Solvers
-
Create a vector whose elements depend on the previous element
684 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
1915 Solvers
More from this Author43
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!