r/Collatz • • May 10 '26 This Bravo Popcorn

I solved the Collatz conjecture, now what?

222 Upvotes

I am making this post in an effort to combat the crankery associated with the Collatz conjecture (or any other famous open problem), and to warn others not to follow this dangerous path that can lead to years or even decades of unproductive effort.

If you think you solved the Collatz conjecture (or any other famous problem like P=NP, Goldbach, twin prime, existence of odd perfect numbers, etc.), follow these steps:

  1. Realize that you almost certainly have not solved the Collatz conjecture. There is a reason why this problem has remained open for almost 9 decades and is called a "dangerous" problem, even by the popular press.

  2. The Collatz conjecture is a mathematical problem; therefore, a proof will not be accepted by mathematicians until it has undergone a rigorous peer review. Every definition, equation, theorem, and even word or phrase can and will be subject to scrutiny. One sentence containing undefined terminology is enough to invalidate the entire argument, even if everything else is correct.

  3. For reviewers to even consider peer-reviewing your work, your paper must be professionally written. It must be neatly typeset in LaTeX and must follow the journal's guidelines and template (if any). It must contain a thorough literature review and it must demonstrate to the reader that you are an expert on the recent literature. It must contain a clear, concise abstract that summarizes its claimed contribution and where other attempts have fallen short.

  4. On a related note to 3., reviewers will not read every claimed proof of the conjecture and are not obligated to look for errors in your 200-page proofs. It is your job to convince the reviewer that your paper is worth a thorough review.

What if you haven't solved the Collatz conjecture, but would like to start working on it?

  1. The best advice is, "Don’t try to solve these problems!" While there are quite a few interesting patterns involving Collatz orbits that one can easily prove, these are almost certainly going to be well-known and not novel enough for a paper.

  2. Don't even attempt the Collatz conjecture until you have, at a minimum, a Ph.D. in mathematics and a publication record in related areas such as number theory, dynamical systems, probability theory, and theory of computation. While it's possible for amateurs or non-Ph.Ds to make novel contributions in mathematics, it is much rarer these days.

  3. Read this paper by Prof. Terence Tao, which is widely considered the closest that humanity has achieved to solving the conjecture.


r/Collatz • • Jun 12 '26

Collatz

121 Upvotes

I disproved collatz
I found a number thats really big where collatz fails. Unfortunately due to reddit character limit, the number is too big to post here. However collatz is sufficiently disproven and there is no longer a need to work on it further.

Thank you for your time and attention to this pressing matter


r/Collatz • • Oct 24 '21

Challenge to this sub: Make some posts about interesting observations about the collatz conjecture instead of attempts to solve it

71 Upvotes

Some suggestions:

  • Take the collatz process and tweak it a little, see how the resulting system differs.

  • Select a measurement, such as the average branch length over many many iterations and share your findings with us.

  • Post visualizations of your findings or use the collatz conjecture as a basis for a piece of art.

  • Hell, use the collatz conjecture in a fun, completely recreational way that might be unexpected or give rise to interesting results even if they are ultimately meaningless.

I am all for mathematical discovery, but walls of numbers with no context and declarations that the conjecture is solved based on the most basic unfounded statements make this sub a drag to browse.

I love the collatz conjecture, but to me it becomes a whole lot more interesting when I realize that, on my own, I’m not going to solve it… and that can make toying with it a lot more fun.

Edit: Oh yeah, and as a challenge, try to make your results as interpretable to others as possible. I understand not knowing the mathematical terms and I’m not the most well versed person myself, but clarity in an explanation can make up for that.


r/Collatz • • Feb 16 '26 Bravo

Conjecture SOLVED for n=9

64 Upvotes

The FULL solution is:

9, 28, 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 3, 2, 1

I know its not much but its still progress. I feel like if we work together we can fully solve it, and I've done my part. To be honest, It didnt even take that long to work it out for n=9.

Can someone do n=10? Its probably a bit harder, but thats someone else's problem now

EDIT: to save any duplication of work here are the numbers SOLVED so far in this thread (NOTE: 10 loops, does NOT go to 1)

2, 4, 9, 10, 18, 23, 27, 2^1483392721, and

295147905179352825857


r/Collatz • • Sep 05 '25

Some Known Collatz Results

61 Upvotes

One thing that I've noticed about this sub is that people often underestimate how many results are already known about Collatz, so I thought I'd mention a few here for reference. Most of these are taken from the Wikipedia page.

  1. If there is a nontrivial cycle, it must be have length at least 355,504,839,929 and must alternate between increasing and decreasing at least 92 times before reaching the original value.

  2. All numbers up to 271 have been confirmed by computer to return to 1.

  3. There's a well-known probabalistic argument that if you take the odd terms in a Collatz sequence, each should be about 3/4 as large as the previous term on average. However, a proof using this argument would require the numbers to "behave like random values," which nobody knows how to prove, and seems totally intractable with current techniques.

  4. It has been proven that for large x, at least x0.84 numbers between 1 and x eventually reach 1.

  5. If negative integers are allowed, there are 3 more known cycles in addition to the trivial one. The smallest values in these cycles are -1, -5, and -17.

  6. One effective way to confirm that certain "Collatz proofs" don't work is to see if the same argument holds for the 3n-1 case instead of 3n+1. If the same argument holds, then the proof can't be correct, because the 3n-1 version has nontrivial cycles.


r/Collatz • • Mar 24 '26 Heartwarming

M.C Siegel, Professional Collatz Research - AMA

57 Upvotes

Hello, r/Collatz!

I’m Max Siegel. Some of you may of heard of me. I’m currently one of the few mathematicians actively working on the Collatz Conjecture and getting something useful out of it. I got bit by the Collatz bug in March of 2017, and have remained obsessed ever since. I completed my PhD in mathematics at the University of Southern California (USC) in May of 2022. I’m currently playing the “I need to get a job” game. When I’m not working as an independent researcher, I’m busy writing sci-fi/fantasy stories.

Though I won’t deny that I dream of proving Collatz one day, my overarching goal as a research isn’t to solve Collatz, but rather to investigate the mathematical oddities that I’ve discovered in the course of studying Collatz and other arithmetic dynamical systems. My hope is that my discoveries will play a key role in solving Collatz at some point in the future.

Please do not ask me to look through your “proof” of Collatz. Other than that, feel free to ask me pretty much anything.

———————————————————————————

Here are some links you guys might find interesting:

The first is a blog post of mine explaining what p-adic numbers are and how they arise.

Secondly, for people interested in examining the Collatz map’s behavior from a computational perspective, I highly recommend you take a gander at Eric Roosendaal’s Collatz website. This site isn’t about finding a proof of the Conjecture, but rather about using lots of computers to examine various statistical properties of the behaviors of integer under the Collatz map.

Thirdly, for anyone with the appropriate mathematical and computer science backgrounds, Stefan Kohl made a software package specifically designed to explore what he calls Residue-Class-Wise Affine Groups (RCWA), his term for Collatz-type maps.

Fourthly, I can’t over-recommend K.R. Matthews’ slides on generalized Collatz problems. Matthews explores Collatz-type maps using Markov chains to model them probabilistically. Of special importance to my work is that these slides give examples of Collatz-type maps that act on spaces other than Z, the set of integers. For example, he gives a map, due to Leigh (1985) which generalizes on Z[√2], the set of all numbers of the form a + b√2, where a and b are integers.

Finally, for an introduction to my research, you can head on over to my Collatz webpage, or to my [YouTube channel](https://youtu.be/xRb8q5DR78E](https://youtu.be/xRb8q5DR78E).


r/Collatz • • Aug 15 '21

This cute little booger takes 100,000 iterations to get to 1. At 30,061 digits long I named it Todd.

Post image
50 Upvotes

r/Collatz • • Nov 09 '25

Suggestions for those attempting a proof

49 Upvotes

First of all, I'd like to say this post might sound rough, but nowhere does it contain lies.

If you are using an LLM (Claude, GPT, Grok, Gemini, or similar), I strongly discourage you from posting your “proof attempt.” LLMs generally fail utterly at writing formal mathematical proofs, sometimes even stumbling over the simplest theorems, concepts, or problems.

If you are not intimately familiar with formal proofs, the foundations of mathematics, or have never handwritten a rigorous proof in your life, it is more likely than not that your argument is either incorrect, incomplete, or lacking in formality. Do not attempt to verify your proofs with LLMs, for the same reasons mentioned above.

By no means do I intend to discourage genuine attempts at proving the Collatz conjecture, nor am I being an academic elitist by insisting you must hold a degree to make an attempt. The purpose of this post is to offer advice to sincere attempters and to stem the tide of ubiquitous bogus “proofs” I have seen here time and again.

My advice is to HANDWRITE your proof, MODEL it in a formal proof assistant such as Lean 4, Rocq (formerly Coq), Metamath, or the like, THEN submit your attempt.

Sorry if it sounds rough. I hope it is not misinterpreted.


r/Collatz • • May 26 '26

Ban LLM posts?

47 Upvotes

I will be blunt... since LLM posts have become more common, this place is getting near insufferable.

LLM posts, LLM replies... can we just agree to ban them and call it a day?

We already are in a niche thats seen as "crackpot" by a lot of the math community... can we not add fuel to the fire by letting a load of nonesense LLM posts litter the subreddit please?


r/Collatz • • May 26 '26

I (wrongly) claimed I solved Collatz a few months ago. Here's what changed my mind.

45 Upvotes

A few months ago I posted here claiming I'd solved Collatz. I had a framework, I was certain, and I was wrong.

What turned it around wasn't being argued down, people did argue and rightly pushback, and at the time it just made me dig in. What actually changed things was a decision: stop defending the work and start attacking it. I built tests whose only purpose was to falsify what I'd claimed.

They did their job. I found an obligation that finite testing simply can't settle, a step where checking more cases, however many, never closes the gap. So here's the honest state of my work now: results that hold up to a bound, an architecture that's only conditionally sound, and one load-bearing step I have not proved and may not be able to.

That's less satisfying than solved, but it's checkable, and it's true, and the version of me from a few months ago couldn't say either of those things.

I'm posting this because I see people here in the spot I was in with a framework in hand, certain, defending it against every reply. If that's you, the most useful thing I can offer isn't a critique of your math. The real work is not simply defending the claim. It's trying to break it yourself, and then saying plainly what survived and what didn't. Eating that humble pie was worth more to me than the claim ever was.


r/Collatz • • Jun 06 '26

Second example of a solvable Collatz-like problem

Post image
44 Upvotes

This is a companion example to the example in my previous post.


r/Collatz • • Oct 20 '25

Why Collatz isn’t solved - the math that does not exist

42 Upvotes

The 3n + 1 map has no closed-form inverse structure that can finitely describe all preimages:

  • Each odd number has infinitely many possible ancestors determined by mixed powers of 2 and 3.

  • These preimage trees overlap irregularly and have no periodic or algebraically bounded pattern.

  • Modular and p-adic analyses (2-adic, 3-adic) decouple rather than constrain each other, so no joint domain captures both parity and multiplicative behavior.

  • Hence, the only way to know whether a value re-creates its own ancestor is explicit traversal - an infinite process.

There is no known or implied math - no evidence of the existence of such math - that would allow for a calculable check on the system without having to explore it to infinity because it is an order dependent iterative

This is why it is so easy to tell when people have a failed proof - because they fail to understand the problem enough to know they need to provide a clear new mathematical technique that does this, instead they make up endless lemmas that beat around the bush - or attempt to argue there is no bush to beat around.

A technique that does this would be quite startling - it would be a thing to talk about, a breakthrough - the real deal - and so far there has not been a hint of it - and history tells us, that not all problems that are “true” are provable - some things simply require taking all the steps - in Collatz case, checking every branch shape and combination - both being infinite.

3n+d is not optional in the study of Collatz if you are trying to make a proof - you will find that 3n+5 will loop at 49 and at 23 - see if you can develop a method of predicting these (you can’t) even though they operate under the same structural control as 3n+1. Initially you will think that there is an argument for why d=1 is different, but there is no rule that says it must be, it seems to not collide yet actually has no protections against doing so - this is the core of the problem.

It is perfect harmony beyond our ability to describe - fluid dynamics is a similar situation.

Both systems exhibit deterministic yet analytically intractable behavior, where exact prediction requires stepwise simulation rather than closed-form solution.

Collatz paths are like integers themselves - in the way that primes make up integers and are unpredictable - structure makes up paths and are unpredictable in the very same way, each time the prior structure does not cover we find new structure, infinitely


r/Collatz • • Mar 17 '24

Just came across the Collatz Conjecture. Was messing around in Python and found this cool relationship that I thought folks here might find interesting :] If anyone has an idea about it I'd love to know!

Post image
41 Upvotes

r/Collatz • • Dec 11 '21

Collatz Conjecture Verified till 2^69

38 Upvotes

Yesterday, the ongoing distributed computing project for Convergence verification of the Collatz problem by David Barina (u/lord_dabler) verified the convergence of all numbers below 269. This is the same project that did it till 268 last year.

The verification to numbers from 268 to 269 which is 268 numbers took 19 months of computation which means more that 5.85 trillion (242.4) numbers per second.

LINKS:
Track the progress: collatz-problem.org

Path records: collatz-problem.org/table

Source code: github.com/xbarin02/collatz

Original paper: rdcu.be/b5nn1


r/Collatz • • Jun 18 '26

Proving the Collatz conjecture is way too difficult for me, so I made an action game based entirely on the 3x+1 rules instead (Even or Odd 1)

36 Upvotes

Proving the Collatz conjecture is way beyond my math skills, so I wanted to share a very different kind of project with people who actually understand the math here.

I'm an indie game dev, and I built an action game where the core mechanics are dictated by the Collatz Conjecture. If the number is even, you strike it with a "÷2" attack. If it's odd, you hit it with a "x3+1" attack.

This video shows the infamous starting number n = 27. Since the sequence requires exactly 111 calculation steps to reach 1, the player must execute a flawless, high-speed 111-hit combo applying the correct operations on the fly.

I know this won't help with the actual proof at all, but I hope it serves as a fun little break for everyone here! I'd love to hear your thoughts on translating this mathematical problem into physical gameplay.

(The game is called "EVEN OR ODD 1" if anyone is curious, but I mainly just wanted to show the visualization here.)


r/Collatz • • May 26 '26

Example of a solvable Collatz-like problem

Post image
32 Upvotes

I made a post here a couple of months back that ended up partially depending on an invalid assumption. This is one of the results which I improved upon that seems to not depend on it.


r/Collatz • • Dec 08 '24

I made a video about the most common "proof" I've seen of this conjecture.

32 Upvotes

Hello, everyone. Many here seem not to grasp just how ridiculously difficult this conjecture is. I made a ~30 minute video where I dissect my own version of this "proof" which I suspect can shed light on the matter.

When you say you've solved this conjecture, you're saying you've found a method that doesn't rely on the conjecture's truth, which can be used to guarantee existence (and probably uniqueness) of a solution to an absurdly intricate diophantine equation with an unknown number of variables. For perspective, some other famous math problems are often diophantine equations having 3 to maybe 5 variables.

Please deeply consider whether your solution entails a method that we can use to solve the equation (which appears at around 21 minutes into the video). Specifically, the method must show that k is finite regardless of what n is, which I think you'll see is almost impossible to guarantee.

If something in the video requires me to elaborate or if you feel your argument is truly novel and deserves its own video, comment and let me know, maybe I can take a look.

Edit: As requested, here is a link to the paper from the video.

Thank you for reading/watching!


r/Collatz • • Aug 03 '26

Collatz Conjecture *was* false. For 2.5 days in July 2026

Thumbnail
youtube.com
31 Upvotes

I am surprised no one has posted it yet. Quite an amusing situation.


r/Collatz • • Apr 29 '23

5 Other Deceptively Simple Unsolved Math Problems That You Might Be Interested In

31 Upvotes

We're all interested in the Collatz Conjecture here, so here's 5 more deceptively simple unsolved math problems that you might be interested in, with explanations about what they are in (deceptively) simple terms.

  1. The Goldbach Conjecture

The Goldbach Conjecture states that every even number greater than 2 can be represented as the sum of two primes. Seems simple enough - other than the involvement of primes - but despite being posed in 1742, no one has ever solved it.

2) The Beal Conjecture

The Beal Conjecture relies on this equation: Ax + By = Cz where A,B,C are positive integers, and x, y, z are positive integers greater than 2. The Beal Conjecture states that any solutions to this equation will necessitate that A, B, and C share at least one prime factor. This one is newer than the Goldbach Conjecture, originating in 1993, but is also unsolved.

3) Brocard's Problem

Brocard's Problem asks if n!+1 = m2 is only true for n = 4, 5, and 7. If any solution exists for an n > 7, the problem is solved, or if any proof can be made that these three values of n are the only solutions.

4) Grimm's Conjecture

Grimm's Conjecture states that for any list of consecutive composite numbers, there will exist at least one way to assign each a unique prime factor that it is divisible by. EDIT: Clarification, "consecutive" here means that the list of composite numbers must take the form n, n+1, n+2, n+3, etc. This doesn't mean that any list of composite numbers in their order of appearance will follow this, just a list of composite numbers of that particular form. Since there are an infinite number of primes, none of the possible lists of composite numbers will be infinite, but there will be an infinite number of such finite lists. Proving the conjecture requires proving it to be true for all of these finite lists, while proving it wrong requires finding only a single list of the proper form that does not follow the conjecture.

5) Legendre's Conjecture

Legendre's Conjecture states that for any number n, there is at least one prime number between n2 and (n+1)2

It's interesting to note how many of these problems would be easily solved by an efficient formula for primes, something that also does not exist yet in mathematics.


r/Collatz • • Jul 28 '25

Can we please ban AI posts?

29 Upvotes

AI posts don't contribute anything of worth to this subreddit.


r/Collatz • • Jun 10 '25

Collatz as Cellular Automata

28 Upvotes

I was thinking I might make a couple of posts about some Cellular Automata I've been messing around with lately to see if anyone is interested. I had heard of the idea before of representing the Collatz transition function as a 1 dimensional CA rule before but couldn't find some good resources to explain exactly how it works or how its derived so I just worked some out myself.

The first and simplest idea comes from representing numbers in base 6. This is a convenient base to use because it makes division by two and multiplying by 3 almost the same operation and they can be done digit by digit, only ever comparing to the next digit. Lets look at a couple examples to see how this works.

Consider the number 594, in base 6 its written 2430₆ that's (2 * 6^3) + (4 * 6^2) + (3* 6^1) + (0* 6^0). To halve it we just halve each digit (rounding down) but if the digit to the left is odd then we also add 3. So we get 1213₆ or 297. If we instead multiple by three: 3*594 = 1782 and in base 6 it's 12130₆. As you can see the digits are identical, but shifted over one place. That's because multiplying by 3 is the same as multiplying by 6 then dividing by 2 and multiplying by 6 in base 6 just shifts the digits over one place. So to multiply by 3 we just shift the digits over and divide by 2.

One more example: Consider 423 which is 1543₆. Dividing by two we get 0551₆. Notice two things; first the leading 1 becomes 0 and we can just drop the leading 0. Also, 551₆ is 411 in base 10 so this process automatically rounds down to the nearest integer. Now look at 3*423 = 1269 or 5513₆. Again its the same as dividing by 2 but shifted over one place. This time however the first digit became 3 instead of 0! That's because the first digit was odd (3), so we add 3 just like any other place.

That's almost all there is to it, but of course we don't just want to multiply by 3. We want to do 3x+1. So if the first digit is odd then we add a 4 (3+1). The last thing we need to construct our Cellular Automata is one more state to represent blanks. We'll use the transition rules with this state to take care of adding these 4's after odd numbers.

So to summarize; We can make a 7 state cellular automata by using 6 states for the digits 0-5 and a 7th state for blank. The transition rules simply divide the digits by 2 and add 3 if the digit to the left is odd. If the cell is in state 1 and the cell to the left is blank then instead of going to state 0 it goes to state blank. Finally, if a cell is in state blank and the cell to the left is odd, then the blank goes to state 4. Now, just write some number in base 6 surrounded by blanks and let the automata do its magic:

This looks pretty cool, but lets look at something bigger! Here's the first few steps of 5^80:

This shows some very interesting patterns. I haven't been able to decipher too much about them yet but it looks reminiscent of some other well known cellular automata such as wolframs rule 30. There's some clear triangular patterns as well as pockets of alternating values. Here's a few more trajectories that I found interesting:

That's probably enough for now. If there's some interest in this post then I can expand on this and show and talk about some other automata. Some using 6, 12, 13 or more states. Let me know what you think. Had you heard of or seen this automata before? Can you use the strange triangular patterns to solve the collatz conjecture? Any other trajectories that you'd like to see?


r/Collatz • • Sep 10 '26

Verified a 1-billion-digit number in ~9 minutes

26 Upvotes

I ran the exact 1,000,000,000-digit integer 23321928093 - 1 to n = 1 in about 9 minutes.

For perspective, the current exhaustive Collatz verification frontier is only about 271: all integers below that bound have been checked.

This is one exact starting value, exactly 23,321,928,093 - 1, so vastly larger, but it does not extend the contiguous verified range.

Method: Collatz-polynomial / macro-step algorithm based on Andreas-Stephan Elsenhans' 2025 work, accelerated with C/C++ + CUDA 13 + exact 64-bit GPU-NTT + GMP on an RTX 4070 Ti.

I can share more data if requested

2 ^ 3 321 928 093 - 1

Final n = 1

Total Actual Steps: 44 701 872 544

Time Elapsed: 533.682857 seconds

Paper: https://arxiv.org/pdf/2502.16743 Their average 1 billion digit time was approx ~68 minutes. This post's average 1 billion digit time is ~3.5 minutes (a randomly picked 1 billion digit number), i.e. a speed up of approx ~20x


r/Collatz • • Jul 09 '23

Collatz problem verified up to 2^70

26 Upvotes

As of July 9, 2023, the project Convergence verification of the Collatz problem was able to verify the validity of the Collatz conjecture for all numbers less than 270. The project started its operations on September 4, 2019. On May 7, 2020, it verified the convergence of all numbers below 268, while on December 10, 2021, it verified all numbers up to 269. The project consumed 7053 CPU-years of computing time (of which 6928 years using the CPU and 125 years using the GPU).


r/Collatz • • Feb 19 '25

Distribution of Collatz Sequence Lengths for 64-bit Unsigned Integer Start Values

Post image
25 Upvotes