Questions tagged [collatz-conjecture]

For questions about the iterated map $n \mapsto 3n+1$ if $n$ is odd and $n \mapsto \frac n2 $ if $n$ is even, and its generalizations.

The Collatz conjecture asserts that every positive integer, when iterated over the function:

$$ f(n) = \begin{cases} \frac n2 & \text{if $n$ is even} \\\ 3n+1 & \text{if $n$ is odd} \end{cases} $$

will eventually be transformed to the cycle $1 \to 4 \to 2 \to 1$.

For example, $7 \to 22 \to 11\ \to 34 \to 17 \to 52 \to 26 \to 13 \to 40 \to \dots \to 5 \to 16 \to \dots \to 1$.

The Collatz conjecture has been verified for $n\le 19\cdot 2^{58}$ [Mathworld].

It may be generalized in multiple ways:

  • One way is to increase the domain on which it is defined, for example to the integers or real numbers. In the former case, it is conjectured that it eventually reaches one of $4$ cycles:

    1. $1 \to 4 \to 2 \to 1$,
    2. $-1 \to -2 \to -1$,
    3. $-5 \to -14 \to -7 \to -20 \to -10 \to -5$,
    4. $−17 \to −50 \to −25 \to −74 \to −37 \to −110 \to −55 \to −164 \to −82 \to −41 \to −122 \to −61 \to −182 \to −91 \to −272 \to −136 \to −68 \to −34 → −17, $

    This is sometimes called the generalized Collatz conjecture.

  • Another way is to change the definition to something of the form $$ f(n) = \begin{cases} \frac n2 & \text{if $n$ is even} \\\ an+b & \text{if $n$ is odd} \end{cases} $$ for fixed constants $a$ and $b$.

545 questions
2
votes
1 answer

Proof of Terras' method for finding T(k)(x) of Collatz sequence.

Terras (via Lagarias) has a method explained here (2.2) for finding the kth term of any Collatz sequence (that is) $$T(n) = \frac{3n+1}{2}$$ if n is odd and $$=\frac n2$$ if n is even. The lambda term makes perfect sense as the factor by which n has…
Ralph
  • 21
2
votes
0 answers

If a collatz sequence doesn't converge, how many odd numbers can its subsequence have?

Let a Collatz sequence of a natural number $x$ as follow: $$\{x\}: \begin{cases} x_0=x\\ x_{n+1} = \begin{cases} \frac{3x_n+1}{2} \text{ if $x_n$ is odd}\\ \frac{x_n}{2} \text{ if $x_n$ is even} \end{cases} \quad\forall…
Le_Square
  • 27
  • 4
2
votes
1 answer

Are there known lower bounds for the values in a cycle in the Collatz graph?

I've found kind of the reverse of what I'm looking for. I've found lower bounds for the length of a cycle when the cycle's members have a certain minimum value. For example, they can be found on Wikipedia here:…
Daniel S.
  • 530
2
votes
1 answer

Status of the Nichols claim to proof of the Collatz conjecture?

In December 2021, Robert Hills Nichols, Jr of Cumberland University claimed a proof of Collatz on arXiv. But I've not seen any reviews or comments on the validity of his claim, and it's certainly beyond me. Is there any validity to his…
QED
  • 265
  • 1
  • 6
2
votes
0 answers

Crandall 1978: $m(2^{A_k}-3^k)<\sum_{j=0}^{k-1}(3+\frac{1}{m})^{k-1}$?

On page 1290 of Crandall 1978, there is a line saying From Corollary (7.1) and Lemma (7.4) we have $$m(2^{A_k}-3^k)<\sum_{j=0}^{k-1}(3+\frac{1}{m})^{k-1}$$ But looking at Corollary (7.1) we…
2
votes
1 answer

Infinite Number of Infinite Fractions From Hailstone Sequences? (Non-Optimized Collatz)

Starting with some number, you can generate the hailstone sequence from it. In the case of 3, the (finite) hailstone sequence of it is $[3,10,5,16,8,4,2,1]$. Placing them in a continued fraction like so:…
2
votes
1 answer

Highest proven Collatz Conjecture stopping time

I'm working on a code challenge that requires finding the total stopping time of a number. I chose a recursive solution because it was the smallest, but Clojure can't guarantee tail-call optimization unless I use recur. To make sure my code works…
2
votes
4 answers

List of properties of the Syracuse sequence

Where can I find an as exhaustive as possible list of all the properties (empirical or proven) related to the Collatz conjecture ? For example I noticed that starting from $2^{n}-1$ the sequence always reach $3^{n}-1$ at some point : $$\forall n \in…
agemO
  • 153
1
vote
1 answer

Modified Collatz Problem

How can one prove for all $n \in \mathbb N$ that the following sequence always results in $1$: Choose $m$ $x_1 = m$ $$x_{n+1} = \begin{cases} x_n/2 & \text{if $x_n$ is even} \\ \\ x_n + 1 & \text{if $x_n$ is odd} \end{cases}$$
Kyle
  • 25
1
vote
2 answers

Closed formula for distances relating to Collatz conjecture?

I've been messing with the collatz conjecture for a while now, and I've found that another way to prove it is through proving that for any number $n$ there is at least one $k$ ($n$ is any odd input and $k$ is the total stopping time of $n$) where…
1
vote
3 answers

Hailstone numbers producing a specific number of rises and falls

How can I find a Hailstone number (from the Collatz sequence), such that it produces a sub-sequence containing $n$ rises and $m$ falls? The rises and falls can be in an arbitrary order. Here a rise step takes $x$ to $(3x+1)/2$, while a fall step…
1
vote
0 answers

What Conway really proved about generalized Collatz functions?

In many sources there are notes that Conway proved that a natural generalization of the Collatz problem is algorithmically undecidable. Let's look at Wikipedia: Specifically, he considered functions of the form: $g(n) = a_{i}n+b_{i}$, where $n…
Tom
  • 159
1
vote
1 answer

Pattern in dropping time of Collatz iteration

I've noticed a linear pattern in the dropping time $C(n)$ of the Collatz iteration (A122437) when plotted against the number of digits $d(n)$ in the base-2 representation of $3^n$ (A020914). Collatz iteration dropping time (vertical) versus the…
1
vote
0 answers

Tendency for cycles to have the same length in Collatz type maps

I was looking at modified versions of the Collatz map of the form $$ C_k(n) = \begin{cases} n/2 \text{ if } n \text{ is even} \\ 3n + k \text{ if } n \text{ is odd} \end{cases} $$ I noticed that for values of $k$ where there are many different…
Eric
  • 11
1
vote
2 answers

Interesting pattern in the number of steps in the Collatz conjecture.

I was playing around with the Collatz conjecture and plotting random things when I came across this. The x axis is the natural numbers and the y axis is the number of steps it takes for each number to reach one. This looked interesting to me, I…
kasra
  • 197