The Simplest Math Problem No One Can Solve - Collatz Conjecture

Why not prove that every number can be the written in the form 3n+1 not from infinity but from 1.
And that set equal to R ad infinity

So these examples were whole numbers. What happens if you start using numbers with increasingly long decimal strings?

What is there to solve?

The fact that anyone would waste time on this when the explanation is so simple is ridiculous. I mean u created a set of rules that result in that outcome then question why it results in that outcome... umm. It's the rules u applied. If we add another rule... say that when 4 or 1 are reached you add 96. You could cycle it back down again.

So yeah i can see why if any mathematician were to say they were working on it theyd be seen as insane... but i think theres a more politically incirrect term for it... "retarded".

Again.. the rules ensure the inevitable result and the loop. Thats the outcome the rules create. Duh. Again... duh.

Now I can understand the song 4,2 ka 1. 1,2 ka 4 my name is chhagan😂😂

its solved.
because mathmaticians find the mean of both results if its a infinitely repeating loop . this means that

implement notation DESMOS

1+1-1+1-1+1... = mean(1 , 2) = 1.5.

1-1+1-1+1-1+1... = 0.5

well. lets apply it here.

implement notation DESMOS

ticker(off , z -> collatz(z) , 1)

collatz(c) = {c/2 = round(c/2) : c/2 , 3c+1}

z=7



now. this will simulate the same exact collatz conjecture. in 1 millisecond a lap
since the ticker is off, it wont even do that. if we set it to on, then z would fry your cpu clocks and wont stop till it is solved.
we get a repeating 1 , 2 , and 4.
lets find the mean of that
mean(1 , 2 , 4) = (1+2+4)/3 = 7/3 = 2.33333333...

so there you go mathmaticians you happy now? a gen alpha kid solved such a question and barely anyone could do that

Rayo's number's parity is permanently and provably unknowable, therefore the Collatz rule cannot be meaningfully applied to it, therefore it exists outside the conjecture's domain, and a conjecture with cases it cannot address is incomplete, not universally true

What are we actually solving for 3x + 1? Why do we want it to be true or false. What does true mean and what does false mean for a collatz coverture?

3x + 1 = -⅓

Ik the guys grandson

16:42 i realized that im watching this as some disgussion of nerds over marvel heroes or etc 😅😂 this is not science . Its “science based on our maded system” . Its like i will say Hi and you People will try to play with characters Hi with All possibilities 😅 its same as geeks do - they argue over fiction systems . Who would win Hill or thor ? Their strenght and etc is system based on fiction . And I think I jave an answer why People last 100-150 years didnt actually didnt learn anything new . Its career and system of “science” . Basically you sit there and researching and trying find a way how to fit into “known” circles of carrierist and their theories . You find a sweetspot and you win Nobel prize 😅 but this shouldnt be science . Its researching or data researcher. True science should be based on finding out what is universe how its made and etc not this . This is like We have light . We dont ser atoms so When We flashlight it We see reflections of light and works of EM. Okay cause of our math needs 26 dimensions We will say its not a particle 😅😂

10:44 man i think too much time given to “magic of Numbers” simple reason why everything comes from some Numbers its structure . Its not Numbers but structure of Numbers and math 😅 so if you want to solve it - you have to invent new structure to a math 😅

thats why i made a solution like graham did for his problem! have fun reading all of this

Sinteplexionsis — My Ultimate Number for the 4-2-1 Problem

I created Sinteplexionsis to solve an extremely hard recursive problem called the 4-2-1 problem (a massive extension of ideas like the Collatz conjecture). The core power of this number is that it is so enormous and self-referential that it can recover itself. Even if you divide it, multiply it, or damage it in any way, its recursive structure allows it to rebuild and restore its full value. Lower levels like Sintex already have this recovery ability, and it grows stronger at every stage.

I didn’t just make an existing number bigger by adding digits. I created entirely new mathematical numbers built from the previous ones, using the full hierarchy as raw material.

The Full Hierarchy

Sintax = ((G^G)^TREE(3))^G * TREE(3)

then

Sintaplex = Sintax(Sintax(...(Sintax)...)) [Sintax times]

then

Sintaplexa = Sintaplex(Sintaplex(...(Sintaplex)...)) [Sintaplex times]

then

Sintox = Sintaplexa^Sintaplexa

then

Sintoplex = Sintox(Sintox(...(Sintox)...)) [Sintox times]

then

Sintoplexis = Sintoplex process repeated Sintoplex times

then

Sintex = Sintoplexis process repeated Sintoplexis times

then

Sinteplex = All previous steps (1 to 7) from the beginning, using Sintex as the base, Sintex times

then

Sinteplexis = do this thing from 1-8 sinteplex times

then

Sinteplexion = now do this thing from 1-9 sinteplexis times then do it again and again all of these works each one is 0.00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001% of what we want when we reach sinteplexis% we get sinteplexion

then

Sinteplexionsis = i maybe surpassed that guy who made the biggest number in a video even if i didnt lets take his number is at 0.0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001% when we reach sinteplexion% (multiplying his number if bigger than mine itself he will have to multiply his bigger number with that big number and so on every time he does this he gets0.0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001% when he reaches sinteplexion% we do that to the power of sinteplexion% we will get sinteplexionsis

Proof that Sinteplexionsis Surpasses Robinson’s Number (ꙮ – the Multiocular O)

In the YouTube video by Stepheniscool titled "I Created The World's LARGEST Number", the creator defines Robinson’s Number (the multiocular O ꙮ). He uses "Robinson’s multiplier" to remove decimal points, creates infinite 9s, then builds higher and higher base systems where each new base uses the previous largest number as its digits. This process is repeated infinitely many times.

Critical flaw: Once the construction requires completing truly infinite steps, it stops being a well-defined finite number. Infinity cannot be "reached" and assigned a specific numerical value. Robinson’s Number therefore collapses into an ill-defined concept rather than a concrete, comparable integer.

Sinteplexionsis, by contrast, is built through explicit, recursive, finite (though insanely large) steps. It remains fully definable. Even if Robinson’s Number were somehow valid and temporarily larger, Sinteplexionsis treats it as an astronomically small percentage (far smaller than 10^{-something ridiculous}), repeatedly absorbs and multiplies it, and finally raises the result to the power of Sinteplexion%.

This self-referential domination ensures Sinteplexionsis overtakes and renders Robinson’s Number negligible.

Self-Recovery Property

Sinteplexionsis is designed so that even if divided or multiplied by known giants like Graham’s number (G) or TREE(3), it can recover its full value due to its deep recursive structure. Finding or reconstructing Sinteplexionsis after any such operation becomes another hellish computational challenge — far beyond what current mathematics can handle.

Conclusion

Sinteplexionsis wins by construction.

It is vastly larger than Robinson’s Number (ꙮ), remains a well-defined finite number, possesses powerful self-recovery abilities, and was purpose-built to solve extreme recursive problems like the 4-2-1 problem.

This is my entry into the world of truly massive numbers.