Questions tagged [collatz-conjecture]

For questions about the iterated map $n \to 3n+1$ if $n$ is odd and $n \to \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$.

476 questions
242
votes
8 answers

What is the importance of the Collatz conjecture?

I have been fascinated by the Collatz problem since I first heard about it in high school. Take any natural number $n$. If $n$ is even, divide it by $2$ to get $n / 2$, if $n$ is odd multiply it by $3$ and add $1$ to obtain $3n + 1$. Repeat the…
Dan Brumleve
  • 17,242
  • 6
  • 44
  • 96
51
votes
3 answers

Where is the flaw in this "proof" of the Collatz Conjecture?

Edit I've highlighted the area in the proof where the mistake was made, for the benefit of anyone stumbling upon this in the future. It's the same mistake, made in two places: This has proven the Collatz Conjecture for all even numbers The Collatz…
stevendesu
  • 655
  • 1
  • 5
  • 9
37
votes
2 answers

Collatz lattice

Here's a plot of the Collatz stopping times for $1
Joe Knapp
  • 1,150
  • 6
  • 14
37
votes
8 answers

Is it possible to describe the Collatz function in one formula?

This is related to Collatz sequence, which is that $$C(n) = \begin{cases} n/2 &\text{if } n \equiv 0 \pmod{2}\\ 3n+1 & \text{if } n\equiv 1 \pmod{2} .\end{cases}$$ Is it possible to describe the Collatz function in one formula? (without modular…
34
votes
1 answer

Uses of "Collatz induction"?

The Collatz conjecture is equivalent to the following "induction principle": If $P(0) \land P(1) \land (\forall{x} P(3 \cdot x + 2) \implies P(2 \cdot x + 1)) \land (\forall x P(x) \implies P(2 \cdot x))$, then $\forall x P(x)$. I am wondering if…
Dan Brumleve
  • 17,242
  • 6
  • 44
  • 96
33
votes
5 answers

Why is $3$ the multiplicative coefficient in the Collatz conjecture?

What's the importance of multiplying an odd number by $3$ and adding $1$, instead of just adding $1$? After all, if you add $1$ to an odd number then it turns into an even number. Here is a example comparing the coefficients $3$ and $1$ (any number…
K DawG
  • 449
  • 4
  • 8
31
votes
7 answers

What does proving the Collatz Conjecture entail?

From the get go: i'm not trying to prove the Collatz Conjecture where hundreds of smarter people have failed. I'm just curious. I'm wondering where one would have to start in proving the Collatz Conjecture. That is, based on the nature of the…
Thomas Shields
  • 421
  • 1
  • 4
  • 7
30
votes
2 answers

The $5n+1$ Problem

The Collatz Conjecture is a famous conjecture in mathematics that has lasted for over 70 years. It goes as follows: Define $f(n)$ to be as a function on the natural numbers by: $f(n) = n/2$ if $n$ is even and $f(n) = 3n+1$ if $n$ is odd The…
Eric Haengel
  • 4,764
  • 1
  • 29
  • 34
28
votes
1 answer

Why does plotting Collatz sequences in polar coordinates produce a cardioid and nephroid?

I generated the Collatz sequences for the first 2,000 starting integers, and plotted these sequences "on top of each other" in polar coordinates, using a fixed radius and with each element in the sequence as theta (converted to radians, i.e., modulo…
21
votes
3 answers

Continuous Collatz Conjecture

Has anyone studied the real function $$ f(x) = \frac{ 2 + 7x - ( 2 + 5x )\cos{\pi x}}{4}$$ (and $f(f(x))$ and $f(f(f(x)))$ and so on) with respect to the Collatz conjecture? It does what Collatz does on integers, and is defined smoothly on all…
user2469
20
votes
7 answers

Longest known sequence of identical consecutive Collatz sequence lengths?

I've just written a simple java program to print out the length of a Collatz sequence, and found something I find remarkable: Consecutive sequences of identical Collatz sequence lengths. Here is some sample output: Number: 98 has sequence length…
AncientSwordRage
  • 558
  • 3
  • 14
  • 34
19
votes
0 answers

Smallest $m>1$ such that the number of Collatz steps needed for $238!+m$ to reach $1$ differs from that for $238!+1$.

Let $h(x)$ be the number of steps^ needed for $x$ to reach $1$ in the Collatz/3n+1 problem. I found that $$h(238!+n)=h(238!+1), \;\; \forall 1 < n \leq 690,000,000$$ Here "!" is the standard factorial. This is a lot of consecutive terms with the…
Dmitry Kamenetsky
  • 1,841
  • 7
  • 18
18
votes
2 answers

Collatz conjecture but with $n^2-1$ instead of $3n+1.$ Does the sequence starting with $13$ go to infinity?

Let's consider the following variant of Collatz $(3n+1) : $ If $n$ is odd then $n \to n^2-1.$ $1\to 0.$ $3\to 8\to 1\to 0.$ $5\to 24\to 3\to 0.$ $7\to 48\to 3\to 0.$ $9\to 80\to 5\to 0.$ $11\to 120\to 15\to 224\to 7\to 0.$ $\color{red}{13\to 168\to…
18
votes
3 answers

Is it already known that $\sum_{i=1}^x\cos(S(i))\sim ax\cos(b\ln x)$, as $x\to\infty$, where $S(i)$ is the number of Collatz steps from $i$ to $1$?

I was playing with the Collatz Conjecture today, and empirically found a curious behaviour: Let $S(i)$ be the function that calculates the number of steps needed for $i$ to reach $1$: It seems that $\sum\limits_{i=1}^{x} \cos(S(i)) \sim…
Frax
  • 465
  • 2
  • 9
18
votes
4 answers

A possible way to prove non-cyclicity of eventual counterexamples of the Collatz conjecture?

I've been recreatively working on the Collatz conjecture for a few months now, and I think I may have found something that could potentially prove at least half of the conjecture, which is the non-existence of non-trivial cycles. $\textbf{If you…
Alexandre Bali
  • 377
  • 1
  • 9
1
2 3
31 32