Problem 44784. Project Euler: Problem 14 Longest Collatz sequence(harder version)

Created by Binbin Qi

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This problem is a harder version of \"Problem 44448. Project Euler: Problem 14 Longest Collatz sequence\", because of time limits.</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"https://ww2.mathworks.cn/matlabcentral/cody/problems/44448\"><w:r><w:t>&lt;https://ww2.mathworks.cn/matlabcentral/cody/problems/44448</w:t></w:r></w:hyperlink><w:r><w:t>&gt;</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>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, no more than N, produces the longest chain, and how long? Don't cheat!</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

13 Solutions
6 Solvers

Last Solution submitted on Jun 11, 2020

Last 200 Solutions

Problem Comments

4 Comments

4 Comments

Show 1 older comment

li haitao on 10 Nov 2018

@ Binbin Qi
Why not setting the upper time limit?
What is the running time of your solution on cody computer?

li haitao on 10 Nov 2018

@Binbin Qi
Please print the variable "t" to help to profile.

Binbin Qi on 11 Nov 2018

@li haitao, I have fix the code, and you should see my running time.

li haitao on 12 Nov 2018

@Binbin Qi,
Almost same with you. I tried many times, but could not speed up any
more.
Want to see some faster solutions in the future.

Problem Recent Solvers6

Problem Tags

collatz euler sequence speed optimization

Problem 44784. Project Euler: Problem 14 Longest Collatz sequence(harder version)

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers6

Suggested Problems

More from this Author17

Problem Tags

Problem 44784. Project Euler: Problem 14 Longest Collatz sequence(harder version)

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers6

Suggested Problems

More from this Author17

Problem Tags

Players