Consequences of Collatz Conjecture being true

Question

Collatz conjecture has been conjectured for a long time and I think there are some evidence showing that it should be true.

Similar to $P \neq NP$ conjecture, is there some interesting consequence if we assume that Collatz conjecture is true? Is there some crazy consequence if we assume that the conjecture is false?

Any reference would be appreciated.

$P \neq NP$ is a much more general conjecture than the $3n+1$ (Collatz) conjecture. So refuting the latter will most likely not have the same implication-magnitude as refuting the former. As to proving - since both are assumed true, neither one of them should have too much implication anyway (expect for the "side effect" of the possibly new methods introduced or discovered during the process). — barak manos, Mar 20 '15 at 22:04
Possible duplicate of What is the importance of the Collatz conjecture? — Did, May 29 '16 at 15:38

score 8 · Answer 1 · answered May 28 '16 at 10:21

More usually with one of these intractable problems, it is not the theorem itself which has some important consequence, rather the method of proof.

The intractability of the problem represents some shortcoming in our mathematical methods, or some failure to recognise two fields or structures within mathematics to be equivalent to each other.

By the act of proving the theorem, some method is often revealed which can be applied to other, similar problems. Because of its nature, the resolution of the Collatz conjecture, if it helps in any way, will most likely extend our capacity to shortcut repetitive algebraic computations, increase our mastery of number theory and improve our understanding of how to solve some category of problems, which we generally find difficult now.

score 4 · Answer 2 · answered Jun 12 '19 at 20:36

4

A proof of the Collatz Conjecture is expected to provide an answer to the following question:

What is the relationship between the prime factorization of $n$ and that of $n+1$?

This would indeed provide a "missing link", as it were, between multiplicative and additive number theory.

answered Jun 12 '19 at 20:36

Klangen

5,075

4

Why is solving the Collatz expected to tell us a relationship between $n$ and $n+1$? – KCd Mar 06 '22 at 06:36
2

Where is the reference for this claim ? I highly doubt that there is a relationship ! Collatz has NOTHING to do with prime numbers. – Peter Apr 13 '22 at 18:05
1

@KCd See $p$-adic valuation. $n \mapsto n/2$ decreases the 2-adic valuation by 1. $n \mapsto 3n$ increases the 3-adic valuation by 1. $n \mapsto n+1$ "scrambles" the $p$-adic valuations in a nontrivial way. – user76284 Jul 31 '22 at 23:17
@Peter Yes it does. See above. See also this answer. – user76284 Jul 31 '22 at 23:17
1

"$+1$" changes the prime factorization completely , so there cannot be a relevant relation. – Peter Aug 01 '22 at 09:44

score 3 · Answer 3 · answered May 15 '18 at 03:51

I suppose a solution could have serious implications on our understanding of iterated functions and dynamic systems in general. A solution to this would most likely involve some ingenious new methods of looking at dynamic systems. What the Collatz conjecture shows us is that even from simple functions we can create systems that are so chaotic mathematicians can't begin to solve it. If we could solve it, the technique would most likely be of use to solving other complex dynamical systems.

D.R. · Answer 4 · 2022-03-06T05:54:48.693

In this nice presentation from Terry Tao https://terrytao.files.wordpress.com/2020/02/collatz.pdf (a video of him presenting these slides can be found here: https://www.youtube.com/watch?v=X2p5eMWyaFs), he mentions that "the absence of non-trivial Collatz cycles can be shown to imply a difficult result in number theory", namely the fact that "the gap between powers of 2 and powers of 3 goes to infinity."

Tao also writes "This theorem is known to be true, but its proof is difficult, requiring a deep result known as Baker’s theorem (which earned Alan Baker the Fields medal in 1970). So solving the Collatz conjecture may be at least as hard as proving Baker’s theorem!"

Consequences of Collatz Conjecture being true

4 Answers4

Linked