he 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?
he 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?
i need the matlab code for this ??
You need to tell us what you have done and where you are having difficulties, we are not here to present you with finished solutions to hand in.
CB
__________________ Truth does not change because it is, or is not, believed by a majority of the people.
Math Help Forum is a community of maths forums with an emphasis on maths help in all levels of mathematics. Register to post your math questions or just hang out and try some of our math games or visit the arcade.
matlab code sequences 
n/2 (n is even)
Linear Mode
