Other Formulations of the Collatz Problem

Start with an integer ; if is even, divide by 2, but if is odd, triple it and add 1; repeat this process. The Collatz problem asks whether 1 is reached. In all known cases, the sequence always reaches 1, but no proof is known that this is always true. There are several equivalent formulations of the problem, some generalizations, optimizations, and a variety of properties; some of them are presented here.

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]

DETAILS

Here is an example using the tag system. Write the number in unary, then remove the first two digits and add the result of applying the rules to the first digit of the previous step; the final result is 1:
For the abstract machine, notice that an even number in base two ends in zero, like the case of 12, whose digits in binary are {1,1,0,0}. Remove the 0s to get 3 with digits {1,1}, corresponding to halving 12 and 6, then add {1,1} and {1,1,1} (a 1 is appended at the end), equivalent to the operation , yielding 10 with digits {1,0,1,0}. Then repeat the operation.
For the correspondence with rational numbers, represent the integer by , where is the highest power of 2 less than , then repeatedly apply the function
where is the denominator and the denominator, until the denominator is 0.
The Syracuse function works with odd integers; start with and compute , factor it as the product of a power of 2 and an odd integer , which is the new term of the sequence; for example .
For more details about the implementation of most of the formulations presented, see the Related Links and [1].
Reference
[1] Wikipedia. "Collatz Conjecture." (Sep 23, 2014) en.wikipedia.org/wiki/Collatz_conjecture.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.