Problem 69. Find the peak 3n+1 sequence value

Created by Cody Team

Solve Later

{"parts":[{"partUri":"/matlab/document.xml","contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?><w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>A Collatz sequence is the sequence where, for a given number n, the next number in the sequence is either n/2 if the number is even or 3n+1 if the number is odd. See</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"\"><w:r><w:t>Problem 21</w:t></w:r></w:hyperlink><w:r><w:t> for more information.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Let c(n) be the sequence for n, and p(n) be the peak value of that sequence. For a given threshold nmax, find the highest peak value max(p(n)) for all Collatz sequences starting with integers between 1 and nmax.</w:t></w:r></w:p></w:body></w:document>","relationship":null}],"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","target":"/matlab/document.xml","relationshipId":"rId1"}]}

<div style = "text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; "><div style="block-size: 93px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 46.5px; transform-origin: 407px 46.5px; vertical-align: baseline; "><div style="block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 369px 8px; transform-origin: 369px 8px; unicode-bidi: normal; "><span style="">A Collatz sequence is the sequence where, for a given number n, the next number in the sequence is either n/2 if the number is even or 3n+1 if the number is odd. See</span></span><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 2px 8px; transform-origin: 2px 8px; unicode-bidi: normal; "><span style=""> </span></span><a target='_blank' href = "/#null"><span style=""><span style="">Problem 21</span></span></a><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 67.5px 8px; transform-origin: 67.5px 8px; unicode-bidi: normal; "><span style=""> for more information.</span></span></div><div style="block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 384px 8px; transform-origin: 384px 8px; unicode-bidi: normal; "><span style="">Let c(n) be the sequence for n, and p(n) be the peak value of that sequence. For a given threshold nmax, find the highest peak value max(p(n)) for all Collatz sequences starting with integers between 1 and nmax.</span></span></div></div></div>

Solve

Solution Stats

3088 Solutions
1574 Solvers

Last Solution submitted on Aug 11, 2022

Last 200 Solutions

Problem Comments

8 Comments

8 Comments

Show 5 older comments

Hariprasad Baburajan on 25 Dec 2018

Nice one

Zoltán Nagy on 26 Apr 2019

Good problem!

Mark McBroom on 10 Jan 2021

good.

Rik on 13 Jan 2021

If you want to add more tests: https://oeis.org/A006884 and https://oeis.org/A006885 contain the relevant sequences.

Tanzil Parvez (Emon) on 3 May 2021

Why the leading solution size is 0 ? Is it for everyone or just me

goc3 on 3 May 2021

@Tanzil Parvez (Emon): the hack solutions (hopefully all) have been deleted from this problem.

Md. Nayem Uddin Biswas on 8 Aug 2022 at 4:47

Wrong test cases! I checked on internet and found all the test cases except case 1 are wrong.

Dyuman Joshi on 8 Aug 2022 at 5:02

The test cases are all correct. You have simply not understood what the question is asking.

Solution Comments

1 Comment

1 Comment

A C on 3 Jan 2019

How would I speed this up?
If I input nmax = 2^60, my program cannot finish.

Solution 1088348

1 Comment

1 Comment

yurenchu on 25 Dec 2016

This solution will fail for nmax = 2; so I had to swap the order of two lines. See Solution 1088355.

Solution 329048

1 Comment

1 Comment

Ted on 4 Oct 2013

wrong, corrected in soln 329062

Solution 24293

1 Comment

1 Comment

Peter Wittenberg on 28 Mar 2012

Clever pattern, but still gaming the system. This is not the absolute highest Collatz peak as you go to infinity. Yuval, you should be ashamed of submitting this without apologies.

Solution 13478

4 Comments

4 Comments

Show 1 older comment

Jed F. on 30 Jan 2012

This really doesn't solve the problem it's just gaming the results.

Kevin Holst on 14 Feb 2012

Boo.

Jean-Yves Tinevez on 17 Feb 2012

Ooooooh this is evil.

Peter Wittenberg on 28 Mar 2012

Pathetic

Problem Recent Solvers1574

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 69. Find the peak 3n+1 sequence value

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers1574

Suggested Problems

More from this Author95

Problem Tags

Community Treasure Hunt

Problem 69. Find the peak 3n+1 sequence value

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers1574

Suggested Problems

More from this Author95

Problem Tags

Community Treasure Hunt

Players