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
38
votes
3 answers

Collatz lattice

Here's a plot of the Collatz stopping times for $1
Joe Knapp
  • 1,170
33
votes
6 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
24
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…
20
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
  • 485
9
votes
1 answer

Collatz $4n+1$ rule?

I noticed something about the Collatz Conjecture, (I was literally obsessed with trying to prove it). I of course have NO intention of trying to prove it, clearly it is beyond my reach and I hope not to offend anyone by what may be a nonsensical…
q.Then
  • 3,080
8
votes
1 answer

What ($\le $) 500-digit number has 62,118 steps ? (Collatz conjecture)

According to this site : https://www.nitrxgen.net/collatz [update 8'2023: the site seems to be down. An archived version of the site can be found at webarchive: https://web.archive.org/web/20160319021630/https://www.nitrxgen.net/collatz ] The…
toto
  • 201
8
votes
1 answer

Collatz stopping times

The maximum stopping times for the Collatz $3x+1$ function have been computed up to about $x = 10^{18}$, given at $3x+1$ delay records. Plotting those results gives this: A more interesting presentation is given on a semi-log plot: It can be seen…
Joe Knapp
  • 1,170
7
votes
4 answers

Are there specific numbers for which the Collatz Conjecture is proven?

Obviously it is proven that all powers of 2 fall to one after applying the rules an arbitrarily large number of times. But are there some other subsets of natural numbers, for which the Collatz Conjecture has been proven? As some comments have…
Mister Set
  • 1,247
5
votes
1 answer

Collatz cycle necessary condition.

Has it been established that a nontrivial m-cycle of the Collatz conjecture on the positive integers would require two consecutive raises (i.e., if $\{x_1, x_2, \ldots x_n\}$ is the odd positive integers in an m-cycle, that $x_j, x_{j+1}$ for some…
user144527
5
votes
1 answer

Collatz variant $7 x + 1$?

Let $n$ be a positive integer Now define the collatz variant if $n=2m$ divide by $2$ as often as possible. if $n=3m$ divide by $3$ as often as possible. if $n=5m$ divide by $5$ as often as possible. else take $7n + 1$ Notice the order of steps…
mick
  • 15,946
5
votes
1 answer

Collatz Conjecture Inquiry

I recently decided to look into the problem for fun, and I came across a pathway to a proof, and, though it's rather long, I was wondering if it has been investigated before. So, for the Collatz Conjecture, to prove it, we just need to prove that…
M.L
  • 179
5
votes
0 answers

$(n_0) \to (n_i)$ and $(n_0+k\cdot2^j)\to(n_i+k\cdot3^i)$, same Glide?

In the Collatz sequence, starting from an odd $n_0$, you can find any odd successor $n$ by applying successively the "condensed" Collatz function: $n_1 = \frac{3}{2^{m_1}}\cdot n_0 + \frac{1}{2^{m_1}}$ $n_2 = \frac{3}{2^{m_2}}\cdot n_1 +…
Collag3n
  • 2,556
5
votes
1 answer

What would be the implications of (dis)proving the Collatz conjecture?

The Collatz conjecture is one of the most famous unsolved problems in mathematics. It essentially states that, for any positive integer, if you repeatedly apply the function 3x + 1 to it, factoring out any factors of 2 you run into along the way,…
4
votes
5 answers

Are there any explanations for these patterns in the Collatz sequences?

I've been messing around with the Collatz sequences a bit, and have come across a few patterns - I was wondering if there are any known explanations for these patterns. The first is the plot of stopping times (sequence lengths) for all Collatz…
Cisplatin
  • 4,675
  • 7
  • 33
  • 58
4
votes
1 answer

The most famous trajectory of $3x+1$ problem

I think that the most famous and beautiful trajectory of the $3x+1$ problem is without doubt that starting from $n=27$ and having a maximum at $9232$. The thing that I find very beautiful is that: $$19\cdot 3^3=513\equiv 1\pmod…
user1225681
1
2 3 4 5 6