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
4
votes
1 answer

Near misses to the start of a potential loop in the Collatz sequence

A355239 contains numbers $k>4$ whose Collatz trajectory visits $k-1$ or $k+1$. These can be considered as near misses to the start of a second potential loop in the Collatz sequence. The last term is 9233. I've searched for further terms, but…
4
votes
2 answers

Veritasium on Collatz — Clarification about loops

I have watched Veritasium's recent video on the Collatz conjecture. At 11m17s, he mentions that if you can show that for every seed value, there is at some point a number less than the seed value in the sequence generated by the Collatz function,…
4
votes
3 answers

Does the following Collatz-like bijection have divergent trajectories?

Let $f:\mathbb Z\rightarrow\mathbb Z$ be the function defined by $$f(3n)=2n$$ $$f(3n+1)=4n+1$$ $$f(3n+2)=4n+3$$ Is there any $x\in\mathbb Z$ such that the sequence $x,\,f(x),\,f(f(x)),\,f(f(f(x)),\ldots$ is not periodic? This question is loosely…
Milo Brandt
  • 60,888
4
votes
3 answers

Proof of Bound for Growth of Divergent Trajectory in $3x+1$ Problem

In this paper, Lagarias makes the following claim in section 2.7 (Do divergent trajectories exist?). Context $$T(x) = \left\{ \begin{array}{rl} \dfrac{3x + 1}{2}, & 2 \nmid x \\ \dfrac{x}{2}, & 2 \mid x \end{array} \right.$$ $$\begin{align*}…
user144527
4
votes
1 answer

Why do these Collatz values seemingly explode and then implode?

Through messing around with some *Collatz values and trajectories, I came across values that seemed to rapidly increase and then 'rather quickly' fall back to one, like an explosion. (They all take less than 150 steps to reach one). Here are the…
4
votes
1 answer

How well do prime-started Collatz sequences cover the integers?

Consider a liberal definition of the Collatz sequence starting from some prime number $p$: $$ C_n(p) = \left\{ \matrix{p & n=0\\C_{n-1}(p)/2 & C_{n-1}(p) \mbox{ even} \\ 3C_{n-1}(p)+1 & C_{n-1}(p) \mbox{ odd}}\right. $$ That is, we are including the…
Mark Fischler
  • 41,743
3
votes
1 answer

Modifying the Collatz conjecture so that when $n$ is odd: $3n + x$

Modifying the Collatz conjecture so that when $n$ is odd: $3n + x$ and where $x$ is odd and $x > 1$. For any odd $x$, starting the sequence at $n = x$ will always lead to a loop: $x \to 3x + x = 4x \to 2x \to x$ But will there always be sequences…
EMN
  • 77
3
votes
2 answers

Is this proof for no non-trivial Collatz cycles flawed?

I've been working with the Collatz Conjecture a lot lately as a way to distract me from the math I'm supposed to be doing for school. Anyway I feel like I've constructed (not very rigorously I might add) a proof that states that the 4-2-1 cycle is…
3
votes
1 answer

Ratio of (Collatz "path" bits) / (starting number bits) $\approx 2$

The "Path Records" page by Eric Roosendaal related to the Collatz conjecture (see here), reports a "striking" feature of the path records. If we define $\text{MaxSeq}(M)$ (in Roosendaal it is $\text{Mx}(M)$) the maximum value reached starting the…
3
votes
3 answers

Infinite sets that are proven to be true for Collatz Conjecture?

I know that the set of powers of 2 and the set of 1,5,21,85,341,... are proven to be true for Collatz conjecture. Are there other sets with infinite number of numbers that are also proven to satisfy Collatz conjecture?
Binh Ho
  • 135
3
votes
2 answers

Does anyone know where I can get a copy of R. P. Steiner, "A theorem on the Syracuse problem"?

R.P. Steiner. "A theorem on the Syracuse problem". In: ed. by D. McCarthy and H. C. Williams. Congressus numerantium; 20. Proceedings of the 7th Manitoba Conference on Numerical Mathematics and Computation, September 29-October 1, 1977. Winnipeg:…
3
votes
1 answer

Collatz Conjecture x+1 and 3x+3

First Question $\bullet$ For the Collatz Conjecture as $ax+b$, when $a=1$ and $b=1$, is it a safe assumption to say that this variant of the conjecture will always reach $1$, since dividing by $2$ will always lower the number further than it will…
3
votes
1 answer

check my idea for prove of Collatz conjecture

I read a couple days ago about the Collatz conjecture. Considering that this problem has been around since the '30s, I'm guessing that my idea written below has a few problems. Nonetheless, I want to know if this sounds like a good approach:…
D.B.
  • 2,339
  • 8
  • 11
3
votes
3 answers

The Worst Case of the Collatz Conjecture

Is $2^x-1$ the worst case scenario of the Collatz Conjecture? Do these numbers generally produce the longest alternating chains? If so, if a highest bound of the length of chains of $2^x-1$ is found, is the does this mean that the Collatz Conjecture…
s20081063
  • 49
  • 5
2
votes
1 answer

Simon Letherman, Dierk Schleicher, and Reg Wood 1999 paper on the 3n+1 problem, further results

I recently read with great interest the 1999 paper : "The 3n+1-Problem and Holomorphic Dynamics Simon Letherman, Dierk Schleicher, and Reg Wood" Experimental Mathematics 8: 3 (1999), 241–252. I found the conjecture relating to the absence of…