Collatz Sequence Maximums

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

To generate the values of the Collatz sequence, start with a number; if it is even, halve it, but if it is odd, triple it and add 1. Repeat the process. For example, if the sequence is 3, 10, 5, 16, 8, 4, 2 and finally 1. The Collatz problem (or problem) states that for any starting number the sequence eventually reaches 1. This is true at least for the many numbers that have been tried. Despite work since the 1930s, no proof for the general case is known. This Demonstration shows the maximums, highlighted in red, reached by the sequence for the first 100 integers.

Contributed by: Hector Zenil (March 2011)
Open content licensed under CC BY-NC-SA


Snapshots


Details

detailSectionParagraph


Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send