r/Collatz • • Jun 12 '26

Solution came to me in a dream

0 Upvotes

First off, let me share that I have discovered not only an astounding counterexample to the Collatz conjecture but also have determined the final digit of Pi at the same time!

The key is to extend the Collatz process to apply to 10-adic integers. Since the odd/even testing can be determined based on just the rightmost digit of the 10-adic integer, this presents no problem to applying the process.

It turns out that if you write out the 10-adic representation for Pi, then this serves as a counterexample for Collatz in that the value will never collapse to 1 no matter how many steps.

It also allows you to represent Pi in a form that has a "last" (rightmost) digit, at the same time!

Unfortunately I forgot the digits as soon as I woke up, so other than knowing that the 10-adic representation of Pi is the unique counterexample to Collatz, I am unable to say anything more.

I am about 50% sure that the last digit of Pi is even, though.


r/Collatz • • Jun 03 '26

I'm an idiot

0 Upvotes

Hi everyone.

I Im not a mathematician and Ive been out of school for 30+ years, but Collatz is just a fun little CPU-time waster.

I believe that the Collatz conjecture will never be definitively proven. Since there is an infinite number of positive integers, you can always add 1 and get infinite + 1. So there are infinitely many even and odd numbers, and that will always lead to 4 2 1 no matter how large the integer is.

It is just my belief, nothing more. But writing code to run the numbers is enjoyable. Looking for a way to parallelize it at the moment. Spread it out over cores and networked machines.

Why, because I get bored sometimes.

Peace and Love.


r/Collatz • • Mar 06 '26

Math fat cats like Gandolf-PC don't want you to read this... But, I think most of us have been missing the actual hard part of proving Collatz.

1 Upvotes

So, my personal theory is that he uses this as a quick litmus test to decide whether a submitted proof is complete nonsense or whether the author at least sees the real obstruction. For some reason, he is weirdly committed to not wanting people to focus on this core problem.

I made this mistake in my first attempt, and now I see it everywhere. The core problem appears in two forms, and a full proof has to solve at least one of them.

There will always be the sharp question about adversarial cycles or divergent orbits: how did you rule out the possibility that at least one starting value realizes some extremely thin, highly biased deterministic pattern that avoids descent forever or closes into a nontrivial cycle?

A common failure mode is that proofs quietly assume some kind of sufficiently favorable residue behavior along every orbit. But Collatz is not random; it is deterministic and only looks pseudo-random. That is exactly what makes it dangerous. You do not get to assume that one orbit cannot remain unusually biased for an unusually long time. You need a theorem strong enough to rule out sustained adversarial bias.

The same issue appears from the other side as the exceptional set. This is really the same obstruction in different language. It is not enough to show that the map usually mixes, usually contracts, or behaves well on average. You have to rule out even a vanishingly thin family of starts whose residue or valuation profile is positioned just right to support divergence or nontrivial recurrence.

If you cannot answer one of those two versions with real accuracy and sufficient force, you very likely do not have a full proof.

He also doesn't want you to know that the geese in the park are free. You can literally just take them. I have 16 right now.


r/Collatz • • May 09 '26

Collatz conjecture

Post image
0 Upvotes

r/Collatz • • Apr 16 '26

Upcoming undergraduate student interested in working on the collatz conjecture as a hobby

0 Upvotes

Hi guys! I've been having an interest in working on the collatz conjecture. To those of you who are experienced number theorists here what would you suggest that I do? I'm not going to expect much from myself, I just really want to see if I can learn something just by working around with the conjecture. Are there any resources that you'd recommend I read up on or any math concepts if ever? Thanks!


r/Collatz • • Jul 25 '26

Finding: All non-trivial peaks are 52 mod 108 or 88 mod 108

0 Upvotes

Proof that all non-trivial peaks must be 108x+52 or 108x+88

First, define a possible Collatz peak: A possible peak is any number (or modulo class) that can be reached from a lower predecessor (without having to pass through a higher number) and whose known successors are only lower numbers.

Note: All maximum values in Collatz sequences are peaks but not all peaks are maximums. Some peaks are local maxima before or after the ultimate sequence maximum. I've verified these results computationally for the first 400 million sequences or so.

We can analyze any modulo class with 2 and 3 factors. 108 is nice because it is 22 x 33 which allows looking 2 steps forward and 3 steps back. However, it is easier and less tedious to start with a smaller modulo (mod 12) and work up.

I walk through the process of elimination below but full results are shown in the spreadsheet here: Collatz - Mod 108 peaks proof

Possible Mod 12 Peaks

Let's eliminate all mod 12 values that cannot be a peak:

  • Odd values rise so would have a higher successor

    • Eliminate 12x+1, 12x+3, 12x+5, 12x+7, 12x+9, 12x+11

  • Multiples of 3 have no predecessor

    • Eliminate 12x+0 and 12x+6 (also 12x+3 & 12x+9 already eliminated)

  • Eliminate values with higher successors

    • Eliminate 12x+2 -> 6x+1 -> 18x+4

    • Eliminate 12x+6 -> 6x+3 -> 18x+10

    • Eliminate 12x+10 -> 6x+5 -> 18x+16

That leaves 12x+4 as the only possible peak.

Its full known sequence is: 4x+1 -> 12x+4 => 6x+ 2 -> 3x+1

Let's look back one more step by multiplying mod 12 by 3. So, the possible mod 36 values that are 12x+4 are 36x+4, 36x+8, 36x+12, etc.

Possible mod 36 Peaks

Let's eliminate mod 36 (congruent with 4 mod 12) values with no lower predecessors:

  • No immediate lower predecessor

    • 36x+8 and 36x+20

  • Multiples of 3 have not predecessor

    • 36x+12 and 36x+24

  • Eliminate mod 36 with only higher 2nd predecessor

    • 36x+4 and 36x+32

  • Eliminate mod 36 with lower "dead-end" 3x predecessor

    • 36x+28 (12x+9 predecessor has no predecessor)

That leaves 36x+16 as the only possible peak.

Its full known sequence is: 8x+3 -> 24x+10 -> 12x+5 -> 36x+16 -> 18x+8 -> 9x+4

Lastly, let's look back one more step by multiplying mod 36 by 3, So, the possible mod 108 peak values are: 108x + 16, 108x + 52 and 108x+88

Possible mod 108 Peaks

We can only eliminate one mod 108 value:

  • Eliminate 108x+16 because it's 2nd lower predecessor is "dead-end" multiple of three

    • 24x+3 -> 72x+10 -> 36x+5 -> 108x+16

Result: That leaves 108x+52 and 108x+88 as only possible mod 108 peak values.

Note the full sequences of each:

16x+7 -> 48x+22 -> 24x+11 -> 72x+34 -> 36x+17 -> 108x+52 -> 54x+26 -> 27x+18

32x+25 -> 96x+76 -> 48x+38 -> 24x+19 -> 72x+58 -> 36x+29 -> 108x+88 -> 54x+44 -> 27x+22

Roughly speaking:

  • 108x+52 goes: 16x to 72x to 108x to 27x

  • 108x+88 goes: 32x to 96x to 108x to 27x

So, the 108x+52 peaks come from a lower predecessor (16x+7 versus 32x+25) so are "peakier." 108x+88 peaks go through 96x which is awfully close to 108x so it is a shallower peak. I think this explains why in the first 400 million sequences roughly six times as many absolute peaks are 108x+52 than 108x+88.

Of course, you can extend this peak analysis to larger and larger modulos (mod 432, mod 768, etc) but possible peak values start multiplying. So, mod 108 is a useful sweet spot with only two possible peak values.


r/Collatz • • Dec 16 '21

Collatz Conjecture Solved 12/13/21

1 Upvotes

Hello community, I am new here but have joined because I have fully solved the Collatz Conjecture on December 13, 2021 at 9:03am and need help getting my proof that shows this in the right hands within the Mathematics community. Does anyone on this thread have contacts that could help me get in touch with the right professor?


r/Collatz • • May 30 '26

I finally definitively proved SOMETHING about the 3x+1 Collatz Conjecture

2 Upvotes

I have proved that the only chains that are 1 iteration in length are 1,4,2,1 and -1,-2,-1

My friend and I learnt about the fact that z^n-1 = (z - 1)*(z^(n-1) + z^(n-2) +^(n-3) ... + z^0 ) and we tried to see if we could find a way to factorize (z^n - a) where a is any real number and my friend figured out that z^n - a =(z-a^(1/n))*( z^(n-1) + a^(1/n) * z^(n-2) + a^(2/n) * z^(n-3) .... a^( (n-1)/n) * z^0)

I have also learnt through working backwards through the collatz conjecture that

(2((2((2x+1)/3)+1)/3)+1) = x simplifies to

(2^2 + 3*2 + 3^2)/(2^3 - 3^3) =x

I then applied the z^n - a factorization thing to 2^2 + 3*2 +3^2 which is = (2^3 - 3^3)/(2-3) and simplified the above function to be -1 = x

I then applied this to any positive integer, c, repeated backwards iteration of the collatz conjecture where the amount the number is multiplied by is a positive integer constant = 2^a and you get the function:

(2^(a*(c-1)) + 3 * 2^(a*(c-2)) + 3^2 * 2^(a*(c-3)) + 3^3 * 2^(a*(c-4)) ... + 3^(c-1) * 2^(a * 0))/(2^(ac) - 3^c) = x

I then did the same as before and simplified the function to be:

((2^(ac) - 3^c)/(2^a-3))/(2^ac - 3^c) = x

which then simplifies to:

1/(2^a-3) = x

and since x must be an integer, the values for variable a can only be: a = 1, 2 and the respective x values can only be x = 1, -1.

I am very happy cause I've been working on the conjecture for over a year. 😄


r/Collatz • • Oct 09 '25

Collatz: Empirical Results – Was Reddit the Right Place?

0 Upvotes

Was Reddit really the right platform to share the empirical results I obtained by applying the Collatz formula, along with the supporting files?
I’ve shared these files at least four times to show that it’s possible to approach this problem simply by observing the modular behavior of Collatz sequences — yet not a single comment was made about them.
Strange, isn’t it?
Bye bye Reddit.


r/Collatz • • Oct 22 '25

How the 2–3 Lattice Explains Collatz Slowdown (Δₖ State Machine)

Thumbnail
gallery
0 Upvotes

Hello fellow explorers of the Collatz mountain!

I’d like to share the path I’ve found toward the summit. While studying the map, I noticed that powers of 2 and 3 actually align along repeating bands — and those alignment zones seem to cause the slowdown we all see in Collatz trajectories.

The Δₖ term captures these offsets through

Φ(k,N)=(3ᵏN+Δₖ)/2ᵏ.

This points to a deterministic structure, not randomness. Would love to hear how this pattern fits (or conflicts!) with your own insights or simulations.

Full open-access paper (with visuals & Python code): https://zenodo.org/records/17415972


r/Collatz • • Nov 11 '25

Collatz Can't Escape to Infinity. The Reason Might Be the Golden Ratio (\phi).

Post image
1 Upvotes

Hello everyone, ​For 85 years, the Collatz Conjecture has been defined by two main questions: ​Does every sequence eventually fall (i.e., not escape to infinity)? ​Are there any other hidden cycles besides {1, 2, 4}? ​My work offers a new analytical and computational proof for the first question. I've developed a continuous model that suggests why the Collatz sequences are "forced" to fall. ​The Brief (The Model & The Discovery) ​My paper analyzes a continuous interpolation of the Syracuse T(x) map (the (3x+1)/2 version). This continuous function, \mathcal{C}_n(x), has a tunable parameter 'n', where Collatz is the specific case when n=2. ​The "Bridge": This continuous model perfectly matches the discrete T(x) map at every integer. ​The Discovery: When I analyzed the "global stability" of this continuous system, I found it's not random. The system's stability is governed by a sharp threshold: The Golden Ratio (\phi \approx 1.618). ​My computational tests (running up to 1 million iterations) show that for any n > \phi, the system is globally stable (it's an "attractor"). ​For any n < \phi, the system is unstable (it "escapes" to infinity). ​The "Why" for Collatz: The Collatz Conjecture uses n=2. Since 2 > 1.618, the Collatz map falls safely within the "globally stable" zone. ​This finding provides a fundamental reason why Collatz behaves this way. It doesn't fall by chance; it falls because it is governed by a universal dynamic law (\phi) that makes "escaping" to infinity a topological impossibility for its parameters. ​This (in my view) rigorously closes the "escape to infinity" gap. ​Here is the paper outlining the model, the "bridge" proof, and the computational proof of the \phi-threshold. I am eager for your feedback and insights.

[PAPER_LINK]


r/Collatz • • Jul 15 '26

Burj Kalihfa

Post image
0 Upvotes

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 • • Apr 07 '26

Do all integers converge under Collatz?

2 Upvotes

I've been trying to find the answer to a question about the Collatz conjecture, and thought that perhaps someone here might know.

Has it been proven that all integers will eventually converge to some cycle? or is it possible that some numbers diverge and "continually increase*" forever?

Obviously it's possible to find a number with an arbitrarily long Collatz sequence - that's not what I'm asking. I'm asking if there are any numbers whose sequence will trend towards infinity.

  • They would have to bounce their way up, with local increases and decreases along the way.


r/Collatz • • Mar 21 '26

Collatz Conjecture

0 Upvotes

SOLVED the answer is 5 🤟🏼❤️‍🔥


r/Collatz • • Aug 10 '26

A possible new Collatz pattern: the 32/9 frontier and eventual (1,4) dominance (A genuine computational research summary - articulated using AI)

0 Upvotes

I’ve been experimenting with the Collatz conjecture from a slightly different direction.

Instead of asking:

“Does every number eventually reach 1?”

I asked:

“How far backwards do we have to go to find an odd multiple of 3 whose Collatz trajectory reaches a given odd number?”

DEFINITION

For an odd integer h, define:

α(h) = the smallest odd multiple of 3 whose accelerated Collatz orbit reaches h.

Then define:

E(N) = max α(h), over odd h <= N.

Call an odd number h “hard” if it sets a new record for α(h).

So hard numbers are the targets that force us to extend the source boundary further than ever before.

AN EARLY EXAMPLE

The first hard odd after 1 is:

19

Its smallest source is:

33 -> 25 -> 19

because:

3*33 + 1 = 100 = 4*25

and:

3*25 + 1 = 76 = 4*19

So the odd-step valuation word is:

(2,2)

THE PATTERN

When hard records are computed further, one particular valuation pattern eventually appears to dominate:

(1,4)

For this branch, the source-target relationship is:

α(h) = (32h - 5)/9

for the appropriate residue class.

Therefore:

α(h)/h = 32/9 - 5/(9h)

and as h becomes large:

α(h)/h -> 32/9

where:

32/9 = 3.555555...

THE CONJECTURE

This suggests the following inverse-coverage conjecture:

E(N)/N -> 32/9 as N -> infinity.

In words:

The worst-case source needed to cover every odd target up to N appears asymptotically to be about:

3.555555... * N

A STRONGER CONJECTURE

There may also be some finite threshold H such that every hard odd h > H satisfies:

α(h) = (32h - 5)/9

In other words:

Every sufficiently large hard record may come from the same valuation word:

(1,4)

I’ll call this “eventual (1,4) dominance.”

WHAT IS ACTUALLY PROVED?

Important distinction:

I am NOT claiming a proof of the Collatz conjecture.

And I am NOT claiming the asymptotic equality E(N)/N -> 32/9 has been proved.

What can be proved in this inverse-cylinder framework is the universal upper bound:

α(h) < (32/9)h

for every odd target h.

There is also a finite inverse-cylinder argument showing that 32/9 is the optimal worst-case slope within that finite positive-cylinder framework.

So the difficult remaining direction is:

liminf E(N)/N >= 32/9

If that could be proved, then together with the upper bound we would get:

E(N)/N -> 32/9

WHY DOES 32/9 APPEAR?

For a valuation word (a1,a2,...,ar), the nominal inverse slope is:

2^(a1+a2+...+ar) / 3^r

For the two-step word (1,4):

2^(1+4) / 3^2

= 32/9

So 32/9 is directly generated by this short valuation pattern.

COMPUTATIONAL RESULTS

I wrote an exact ascending-source scanner that records every new hard odd.

The exhaustive computation currently goes through:

10,000,000,000

Results:

Hard records found:

11,972,736

Hard records following the (1,4) formula:

11,972,706

Exceptions:

30

Largest exceptional hard odd:

87,967

New non-(1,4) hard records between 87,967 and 10,000,000,000:

NONE

THE FINAL HARD RECORD BELOW 10^10

The last hard odd found below 10 billion is:

h = 9,999,999,667

Its smallest source is:

α(h) = 35,555,554,371

And exactly:

35,555,554,371

= (32*9,999,999,667 - 5)/9

So it is another exact (1,4) record.

WHY I FIND THIS INTERESTING

Most Collatz research looks at the forward orbit:

n -> T(n) -> T^2(n) -> ...

This construction instead looks at an extremal property of the inverse graph.

What is surprising is that a complicated reverse structure appears to develop a very simple boundary:

32/9

generated by a tiny valuation pattern:

(1,4)

Early hard numbers come from several different valuation words.

Then, in the computation, those competing families disappear.

After 87,967, every single new hard record through 10 billion follows the same (1,4) formula.

THE MAIN QUESTION

Can anyone prove that every sufficiently large hard odd must come from the (1,4) family?

Or, alternatively:

Can anyone find an arbitrarily large hard odd that is NOT generated by (1,4)?

A WEAKER TARGET

Even without proving eventual (1,4) dominance, it would be enough to prove:

liminf E(N)/N >= 32/9

because the matching upper bound is already available in the finite-cover framework.

WHAT THIS DOES NOT PROVE

Even if the 32/9 conjecture is true, it does NOT automatically prove the classical Collatz conjecture.

The 32/9 statement is about reverse coverage:

“How large a source is needed to reach a target?”

The Collatz conjecture is about forward convergence:

“Does every starting value eventually reach 1?”

These are related, but they are not the same statement.

LITERATURE QUESTION

I have searched for this specific formulation:

- the inverse record function E(N)

- hard odds defined by record values of α(h)

- the 32/9 asymptotic frontier

- eventual (1,4) dominance

and I have not found an equivalent conjecture in the Collatz literature.

If anyone knows an earlier equivalent formulation, I would genuinely appreciate the reference.

WHY I’M POSTING THIS:

I’m mainly interested in three things:

  1. Does someone see a theoretical reason why (1,4) should eventually dominate?

  2. Can someone construct a large competing valuation family?

  3. Is there an existing theorem in Collatz dynamics, p-adics, symbolic dynamics, inverse trees, or ergodic theory that naturally explains the appearance of 32/9?

I have the derivation, finite-cover argument, exact computation code, and longer write-up available if anyone wants to inspect them.

EDIT: Added an illustrative explanation of "Hard" Odds - let's say we want to construct node graph - on y axis we will keep adding all the "O" odd multiples of 3 (source branch) and then keep going forward from each odd to the next path till we reach 1 or jump to existing path of any other O. Now, we are interested to know when we increase O step by step, what are some properties that we discover - one of them is asking are all the how many odds less O are present in the graph: for example in the starting case of O=3, graph has all the odds <3 that is 1 is present; now we generalize this expression by saying when will be the next odd k be discovered that hasn't been found yet and let it's source O be E(k) - now the conjecture is about k/E(k) - attached are the graphs till O=57

Graph for O=3 | all odds <3 are discovered - no hard odd found

Graph for O=9 | all odds <9 are discovered - no hard odd found

Graph for O=15 | all odds <15 are discovered - no hard odd found

Graph for O=21 | all odds <21 are not discovered - hard odd found 19, with source node E(O)= 33 and valuation of (2,2)

Now jumping to Graph for O=33 (skipped 27 as 19 continued) | all odds <33 discovered - no new hard odd found

Graph for O=39 | all odds <39 are not discovered - hard odd found 37, with source node E(O) = 57 and valuation of (2,1,2,2)

Now jumping to Graph for O=57 (skipped 45,51 as 37 continued) | all odds <57 are not discovered - hard odd found 55, with source node E(O) = 129 and valuation of (2,2,2)

Now, what you are seeing is that for every E(O), let's name in Exhaustive cut-off ratio resets after every hard odd O is encountered - if we plot the graph of E(O)/O - it looks like the following

After 133rd odd which is 89425, all hard odds till 10 Billion have had bone path from bone parent as 1,4

This is the conjecture, as O tends to grow infinitely larger, the ratio E(O)/O starts settling down to 32/9 which is weird as so many competing paths other 1,4 could have emerged but we don't why it takes over in the long term as observed in data - logically we know the upper bound is 32/9 but it can achieved by 1,2,2 or 1,1,2,1 any other combo but 1,4 is special we don't why, secondly we don't know the lower bound and hence cannot prove convergence like is 2,2 possible for any number after 10 billion - which will disprove the conjecture.

Last image - shows how E(O)/O looks like on log scale for very high O- almost converging to 32/9

Table of all hards odds upto last exceptional hard odd

hard_indexhard_oddbone1_parentvaluation_wordfamilydefect_32h_minus_9parent
1121-6exception-157
21933(2,2)exception311
33757(2,1,2,2)exception671
455129(2,2,2)exception599
5109171(1,2,2,2)exception1949
6127225(2,2)exception2039
7163513(2,2,2,2)exception599
8271759(1,1,3,2,2,2)exception1841
9379897(2,2,2)exception4055
104871215(1,1,1,1,1,2,3,4)exception4649
115411281(2,2,2)exception5783
126492049(2,2,2,2)exception2327
139732427(1,2,1,2,2,2,2,2)exception9293
1410272433(2,2,2)exception10967
1511353585(2,2,2,2)exception4055
1614595187(1,4)(1,4)5
1719456915(1,4)(1,4)5
1825938193(2,2,2,2)exception9239
1927018535(1,1,4,2)exception9617
2029179711(1,1,1,2,1,1,2,3,4)exception5945
2130799729(2,2,2,2)exception10967
22340311175(1,1,2,1,2,2,2,1,1,1,1,2,1,1,2,3,1,1,2,3,4)exception8321
23405112801(2,2,2,2)exception14423
24421314979(1,4)(1,4)5
25437515555(1,4)(1,4)5
26486117283(1,4)(1,4)5
27534719011(1,4)(1,4)5
28583320739(1,4)(1,4)5
29631922467(1,4)(1,4)5
30729125569(2,2,1,1,1,2,2,1,2,2,2,2,2,2)exception3191
31777727651(1,4)(1,4)5
32858728587(1,2,2,2,1,2,2,2,2)exception17501
33874929127(1,1,2,2,2,2,2,2,2)exception17825
34923530747(1,2,1,1,1,1,2,3,4)exception18797
35988331233(2,2,2,2)exception35159
361036932769(2,2,2,2)exception36887
371069338019(1,4)(1,4)5
381215143203(1,4)(1,4)5
391312346659(1,4)(1,4)5
401458151843(1,4)(1,4)5
411603957027(1,4)(1,4)5
421652558755(1,4)(1,4)5
431733561635(1,4)(1,4)5
441749762079(1,1,1,1,1,1,2,1,2,2,2,1,2,1,2,1,1,3,1,1,3,2,1,2,2,1,1,1,1,1,1,3,1,1,1,2,1,1,1,1,2,2,3,1,2,2,2,2,1,3,3,1,2,3,4)exception1193
451798363939(1,4)(1,4)5
461846965667(1,4)(1,4)5
471895567395(1,4)(1,4)5
482089974307(1,4)(1,4)5
492170977187(1,4)(1,4)5
502187177763(1,4)(1,4)5
512235779491(1,4)(1,4)5
522284381219(1,4)(1,4)5
532332982947(1,4)(1,4)5
542381584675(1,4)(1,4)5
552527389859(1,4)(1,4)5
562624593315(1,4)(1,4)5
572770398499(1,4)(1,4)5
5828189100227(1,4)(1,4)5
5929161103683(1,4)(1,4)5
6029647105411(1,4)(1,4)5
6130457108291(1,4)(1,4)5
6230619108867(1,4)(1,4)5
6331105110595(1,4)(1,4)5
6431591112323(1,4)(1,4)5
6532077114051(1,4)(1,4)5
6632563115779(1,4)(1,4)5
6733535119235(1,4)(1,4)5
6834021120963(1,4)(1,4)5
6934831123843(1,4)(1,4)5
7034993124419(1,4)(1,4)5
7135479126147(1,4)(1,4)5
7236937131331(1,4)(1,4)5
7337909134787(1,4)(1,4)5
7438395136515(1,4)(1,4)5
7539367139971(1,4)(1,4)5
7640825145155(1,4)(1,4)5
7741311146883(1,4)(1,4)5
7842769152067(1,4)(1,4)5
7943579154947(1,4)(1,4)5
8043741155523(1,4)(1,4)5
8144713158979(1,4)(1,4)5
8245199160707(1,4)(1,4)5
8345685162435(1,4)(1,4)5
8446657165891(1,4)(1,4)5
8547143167619(1,4)(1,4)5
8650059177987(1,4)(1,4)5
8750545179715(1,4)(1,4)5
8851517183171(1,4)(1,4)5
8952489186627(1,4)(1,4)5
9053947191811(1,4)(1,4)5
9154433193539(1,4)(1,4)5
9255405196995(1,4)(1,4)5
9355891198723(1,4)(1,4)5
9456701201603(1,4)(1,4)5
9556863202179(1,4)(1,4)5
9657349203907(1,4)(1,4)5
9757835205635(1,4)(1,4)5
9858321207363(1,4)(1,4)5
9958807209091(1,4)(1,4)5
10060265214275(1,4)(1,4)5
10161237217731(1,4)(1,4)5
10262209221187(1,4)(1,4)5
10362695222915(1,4)(1,4)5
10463181224643(1,4)(1,4)5
10564639229827(1,4)(1,4)5
10665611230139(1,2,1,2,1,1,2,2,2,2,2,2,2,2)exception28301
10767069238467(1,4)(1,4)5
10867555240195(1,4)(1,4)5
10968527243651(1,4)(1,4)5
11069013245379(1,4)(1,4)5
11169823248259(1,4)(1,4)5
11269985248835(1,4)(1,4)5
11370471250563(1,4)(1,4)5
11470957252291(1,4)(1,4)5
11571443254019(1,4)(1,4)5
11671929255747(1,4)(1,4)5
11772901259203(1,4)(1,4)5
11873387260931(1,4)(1,4)5
11975331267843(1,4)(1,4)5
12075817269571(1,4)(1,4)5
12177761276483(1,4)(1,4)5
12278733279939(1,4)(1,4)5
12380191285123(1,4)(1,4)5
12480677286851(1,4)(1,4)5
12582945294915(1,4)(1,4)5
12683107295491(1,4)(1,4)5
12783593297219(1,4)(1,4)5
12884079298947(1,4)(1,4)5
12984565300675(1,4)(1,4)5
13085051302403(1,4)(1,4)5
13186023305859(1,4)(1,4)5
13287967308559(1,1,1,3,2,1,2,1,1,1,1,2,3,4)exception37913

r/Collatz • • Oct 24 '24

Im thinking of putting a bounty on my article.

0 Upvotes

I’ve been working on an article about the Collatz Conjecture, but it’s been repeatedly rejected at the editorial stage. I’m beginning to wonder if it’s not a flaw in my article but rather the stigma around the word "Collatz" itself.

So, I’m putting up a INR10,000 (around $120) cash prize for anyone who can find an error in my article.

I’ll be sharing it with my university and mass mailing it to the Maths department shortly.

One more rejection, and this bounty is going live.

EDIT: The cover letter that I send along is:

An interesting insight about repeating odd integers in the Collatz-type sequences has been discovered.
Consider the following odd integers that form a repeating cycle in the 5z+1 sequence:

1= 2-1
3= (2^2)-1
13= (2^3)+(2^2)+2-1
17= (2^4)+2-1
27= (2^4)+(2^3)+(2^2)-1
33= (2^5)+2-1
43= (2^5)+(2^3)+(2^2)-1
83= (2^6)+(2^4)+(2^2)-1

As observed, all of these integers end with either 2-1 or (2^2)-1.

The MS, attached for your consideration, demonstrates that this is not a coincidence, but rather a rule that governs the behavior of all odd integers appearing in repeating cycles for the 5z+1
sequence.

Furthermore, we have discovered and proved a similar rule for the 3z+1 sequence.

Just because one guy said he cant do it, these editors think no one can! I'm collecting all the rejection mails and I'll post them once my article is published. Hope these editors then come forward and tell what grave error they found that merit the rejection of the MS.

(I honestly want to let loose and say so many bad words but trying to be hopeful.)

LINK TO THE ARTICLE: https://www.preprints.org/manuscript/202408.2050/v5


r/Collatz • • Jul 27 '25

A Simple Assumption About the Collatz Conjecture Just Broke the Whole Thing

0 Upvotes

I have come to bargain once more. Prob my best argument yet, or I don't know man, I am lowkey running out of free time academic studies gonna cook me.
,
A Rigorous Argument Against Non-Trivial Collatz Cycles

The Collatz Conjecture (also known as the 3n+1 problem, Ulam conjecture, Kakutani's problem, Thwaites conjecture, Hasse's algorithm, or Syracuse problem) is a deceptively simple mathematical problem that has stumped mathematicians for decades.

What is the Collatz Conjecture? Take any positive integer. If it's even, divide it by 2. If it's odd, multiply it by 3 and add 1. Repeat the process. The conjecture states that no matter what positive integer you start with, you will always eventually reach the number 1. Once you hit 1, the sequence goes 1→4→2→1, forming a trivial cycle.

Why is it Important/Hard? Despite its simple formulation, no one has been able to prove or disprove the Collatz Conjecture. It's easy to state but incredibly difficult to solve, leading to it being described as "hopelessly difficult" by Paul Erdős. It connects various fields of mathematics, including number theory, dynamical systems, and computation, revealing unexpected complexity in seemingly basic arithmetic. Proving it would be a major breakthrough in number theory.

What are Non-Trivial Cycles? A "non-trivial cycle" would be a sequence of numbers that repeats without ever reaching 1. For example, if you started at 7 and it went 7→22→11→⋯→7, that would be a non-trivial cycle. If such a cycle exists, the conjecture is false. Extensive computer searches have checked numbers up to 268 (over 295 quintillion) and found no non-trivial cycles, strongly suggesting they don't exist. Our argument focuses on proving this mathematically.

Mathematicians Mentioned:

  • A. Baker: Alan Baker is a renowned British mathematician known for his work on Diophantine equations and transcendental number theory, particularly his development of Baker's theory of linear forms in logarithms. This theory provides powerful tools for finding effective bounds for the solutions of certain Diophantine equations, which is crucial for the "Baker-Rhin Bound" used here.

  • G. Rhin: Georges Rhin is a French mathematician who, along with Baker and others, contributed to refining the bounds in Diophantine approximation, specifically regarding linear forms in logarithms.

  • J. C. Lagarias: Jeffrey C. Lagarias is an American mathematician who has done extensive research on the Collatz Conjecture. He is credited with applying the Baker-Rhin type bounds to the Collatz problem, which forms a cornerstone of this proof. His 1985 paper "The 3x+1 Problem and Its Generalizations" is a seminal work in the field.

The Proof

Let's assume, for the sake of contradiction, that a non-trivial Collatz cycle exists.

1. Cycle Setup and Fundamental Equation

Assume, for the sake of contradiction, that a non-trivial Collatz cycle exists. Let a_0, a_1, ..., a_n-1 be the n distinct odd integers in this cycle, with a_0 being the smallest, and a_0 >= 3 (since a_0 = 1 leads to the trivial cycle 1 → 4 → 2 → 1).

Each step in the cycle for an odd number a_i is given by: a_i+1 = (3 * a_i + 1) / 2^k_i for i = 0, 1, ..., n-1 where k_i >= 1 is the number of divisions by 2 until the next odd term a_i+1 is reached.

Let K be the total number of divisions by 2 over the entire cycle of n steps: K = Σ_{i=0 to n-1} k_i

The entire cycle returns to a_0 after n steps. Multiplying all n step equations together and using a_n = a_0 (as it's a cycle), we arrive at the fundamental cycle equation: a_0 = (3^n * a_0 + S) / 2^K

Where S is a positive integer (representing the sum of scaled +1 contributions from each 3x+1 operation). Rearranging this equation: 2^K * a_0 = 3^n * a_0 + S (2^K - 3^n) * a_0 = S (Equation 1)

Since a_0 and S are positive, it follows that (2^K - 3^n) must also be positive. Thus, 2^K > 3^n.

2. Bounding k_i and a_i

From the definition a_i+1 = (3a_i + 1) / 2^k_i, and given that a_i+1 >= a_0 (since a_0 is the smallest in the cycle), we have: (3a_i + 1) / 2^k_i >= a_0 3a_i + 1 >= a_0 * 2^k_i 2^k_i <= (3a_i + 1) / a_0

This shows that k_i is bounded (logarithmically) in terms of a_i and a_0. Crucially, this does not force k_i = 1 for all steps. All a_i terms in a cycle must remain bounded, which in turn means all k_i are bounded.

3. Applying Diophantine Bounds (Baker's Theorem)

From Equation (1), we have |2^K - 3^n| = S / a_0.

To establish a lower bound for |2^K - 3^n|, we use results from Baker's theory on linear forms in logarithms. These theorems provide lower bounds for expressions like |K * log 2 - n * log 3|. For integers K, n (with n >= 1), there exists a constant d_B > 0 (from Baker's theorem) such that: |K * log 2 - n * log 3| >= 1 / n^(d_B)

To translate this to |2^K - 3^n|, we use the Mean Value Theorem. For a differentiable function f(x) = e^x, |f(x) - f(y)| = |x - y| * e^ξ for some ξ between x and y. Let x = K * log 2 and y = n * log 3. Then |2^K - 3^n| = |e^(K * log 2) - e^(n * log 3)| = |K * log 2 - n * log 3| * e^ξ where ξ is between n * log 3 and K * log 2. Since 2^K > 3^n (from (2^K - 3^n) * a_0 = S > 0), we have K * log 2 > n * log 3. Thus, ξ > n * log 3. So, e^ξ > e^(n * log 3) = 3^n.

Therefore, combining with the Baker bound: |2^K - 3^n| > |K * log 2 - n * log 3| * 3^n >= (1 / n^(d_B)) * 3^n |2^K - 3^n| >= 3^n / n^(d_B) (Equation 2 - Corrected Baker-type lower bound)

Now, substitute |2^K - 3^n| = S / a_0 from Equation (1) into Equation (2): S / a_0 >= 3^n / n^(d_B)

We need an upper bound for S. Each term in S is of the form 3^(n-1-i) * 2^(Σ k_j). A generous (but sufficient for asymptotic analysis) upper bound is S <= n * 3^n. (We use S <= n * 3^n as a generous upper bound, though tighter exponential bounds may apply.)

Substitute S <= n * 3^n into the inequality: (n * 3^n) / a_0 >= 3^n / n^(d_B)

Cancel 3^n from both sides (since 3^n is positive): n / a_0 >= 1 / n^(d_B)

Rearrange to get an upper bound for a_0: a_0 <= n * n^(d_B) = n^(d_B+1) (Equation 3 - Polynomial upper bound on a_0)

Let d_A = d_B + 1. So, a_0 <= n^(d_A). Let d_A > 0 be the constant such that a_0 <= n^(d_A). This d_A is directly related to d_B from Baker's theorem.

4. Growth Constraints and Irrationality

For a Collatz cycle to exist, the product of growth factors over n steps must be 1. The growth factor for a step a_i → a_i+1 is (3 / 2^k_i) * (1 + 1 / (3a_i)). So, Π_{i=0 to n-1} [(3 / 2^k_i) * (1 + 1 / (3a_i))] = 1.

Take the natural logarithm of both sides: Σ_{i=0 to n-1} [log 3 - k_i log 2 + log(1 + 1 / (3a_i))] = 0 n * log 3 - (Σ k_i) * log 2 + Σ_{i=0 to n-1} log(1 + 1 / (3a_i)) = 0 Since K = Σ k_i: n * log 3 - K * log 2 + Σ_{i=0 to n-1} log(1 + 1 / (3a_i)) = 0

Using the approximation log(1 + x) ≈ x for small x (which 1/(3a_i) is, since a_i >= a_0 >= 3): n * log 3 - K * log 2 + Σ_{i=0 to n-1} (1 / (3a_i)) ≈ 0

Rearranging: |K * log 2 - n * log 3| ≈ |Σ_{i=0 to n-1} (1 / (3a_i))|

Since a_i >= a_0 for all i, we can provide an upper bound for the sum: Σ_{i=0 to n-1} (1 / (3a_i)) <= Σ_{i=0 to n-1} (1 / (3a_0)) = n / (3a_0)

So, the upper bound on the difference |K * log 2 - n * log 3| is: |K * log 2 - n * log 3| <= n / (3a_0) (Equation 4)

5. Contradiction

We now combine the polynomial upper bound for a_0 (from Equation 3) with the upper bound on the difference |K * log 2 - n * log 3| (from Equation 4).

From Equation (3), we have a_0 <= n^(d_A). To make the right side of Equation (4) as small as possible (to tighten the upper bound on the difference), we use the maximum possible value of a_0:

|K * log 2 - n * log 3| <= n / (3 * n^(d_A)) |K * log 2 - n * log 3| <= 1 / (3 * n^(d_A-1)) (Equation 5 - Derived upper bound on the difference, UB_delta)

Now, we compare this with the precise lower bound provided by Baker's Theorem (Equation 2, rewritten for the logarithmic form): |K * log 2 - n * log 3| >= 1 / n^(d_B) (Equation 6 - Theoretical lower bound on the difference, LB_delta)

For a cycle to exist, the same quantity |K * log 2 - n * log 3| must satisfy both bounds simultaneously. This means the derived upper bound (Equation 5) must be greater than or equal to the theoretical lower bound (Equation 6):

1 / (3 * n^(d_A-1)) >= 1 / n^(d_B)

Rearrange this inequality: n^(d_B) >= 3 * n^(d_A-1)

Divide both sides by n^(d_A-1) (assuming n > 0): n^(d_B - (d_A-1)) >= 3 Let X = d_B - (d_A-1) = d_B - d_A + 1. So, n^X >= 3.

Here is the key point. Rigorous results from Baker's theory provide explicit values for d_B. When the analysis that leads to the upper bound a_0 <= n^(d_A) (and thus d_A) is performed carefully by experts (e.g., Lagarias), it turns out that the exponent X = d_B - d_A + 1 is positive (i.e., X > 0).

Since X > 0, the term n^X is a monotonically increasing function of n. This means that for sufficiently large n, n^X will grow without bound and inevitably become greater than 3.

Therefore, for sufficiently large n, the inequality n^X >= 3 will always be true. This implies that for sufficiently large n, n^(d_B) will be greater than 3 * n^(d_A-1). Consequently, 1 / (3 * n^(d_A-1)) (our UB_delta) will become smaller than 1 / n^(d_B) (our LB_delta).

So, for sufficiently large n, we have: UB_delta < LB_delta |K * log 2 - n * log 3| <= UB_delta < LB_delta <= |K * log 2 - n * log 3|

This leads to the impossible condition |K * log 2 - n * log 3| < |K * log 2 - n * log 3|, which is a contradiction. This contradiction proves that no such non-trivial Collatz cycle can exist for n greater than some computable threshold (which depends on the precise values of d_A and d_B).

For small n (values below this computationally determined threshold), extensive computer searches have already ruled out any non-trivial cycles. For example, exhaustive verification has shown no Collatz cycles exist for starting numbers up to at least 268 (over 295 quintillion).

Thus, by combining the theoretical result for large n with computational verification for small n, we can conclude:

Therefore, no non-trivial Collatz cycles exist.

Q.E.D. 🎉

TL;DR

Assume a Collatz cycle exists that doesn't include 1. Using advanced number theory (Baker's theorem), we get two key insights:

  1. The smallest number in such a cycle (a_0) cannot be infinitely large; its size is limited polynomially by the cycle length n (e.g., a_0 grows no faster than n raised to some power).

  2. The required "balance" in the cycle (specifically, how close K divisions by 2 are to n multiplications by log_2 3) must fall within a very tight range. Baker's theorem provides a minimum possible non-zero value for this "imbalance" (a polynomial function of n).

When we combine these, we find that for sufficiently long cycles (n), the maximum allowed imbalance (derived from the cycle's structure and the a_0 limit) becomes smaller than the minimum allowed imbalance (guaranteed by Baker's theorem). This is a mathematical impossibility (a value cannot be simultaneously smaller than one number and larger than another number that is actually larger than the first). This contradiction means such long cycles cannot exist. For shorter cycles, computers have already checked all possibilities and found none. Therefore, no non-trivial Collatz cycles exist.


r/Collatz • • Jun 01 '25

The most difficult part of proving this conjecture is the cycles.

Thumbnail drive.google.com
0 Upvotes

There are no cycles other than 1 in positive odd integers.


r/Collatz • • Nov 04 '24

Follow up: Pixel Manipulation by The Collatz Algorithm - A Visual Exploration

0 Upvotes

r/Collatz • • Nov 02 '22

I have posted an updated proof of the 3n+1 Collatz conjecture

0 Upvotes

r/Collatz • • Aug 13 '24

Found this pic of the Collatz Conjecture out in the wild...

Post image
0 Upvotes

r/Collatz • • Jan 19 '25

The First "Uncollatzable" Number

0 Upvotes

I have made some interesting discoveries into the collatz's behavior, although, like many others, have not proved anything or backed anything up in real math, nor checked their validity or originality.

Recently I have been playing around with the idea of the first "uncollatzable" number. As in, assuming there are no loops, what are some things we know about the first "uncollatzable" number?

I think it would be beneficial for a robust list to exist. Little things that we can prove about the first "uncollatzable" number.

We know it must be odd, but what else do we know?

(If this method of thinking about it is wrong please let me know, and if there already exsits such a list please let me know.)

Edit: we assume a first uncollatzable aka a number that does not reach one, exists, in the hopes that we can violate one of its rules and disprove its exsitance.


r/Collatz • • Nov 05 '24

stopping at the first odd number and the resulting sequences

0 Upvotes

there are classes (sets) of odd numbers

Each class is closed with respect to the Collatz rules.

Numbers within a class share certain modularity and sequence properties.

The sequences of numbers within each set are related to each other, which would imply that an ordering of these sequences would reveal additional structure.