07/28/2026
COLLATZ CONJECTURE : A MYSTERY OF MATHEMATICS 🌹❤️♥️
THE CONCEPTION OF COLLATZ, A STONEY PATH🌹❤️♥️
There is a unique way to confront assumption, it is through expressions that cause the initial value to drop below its value. The app that does this is (xo-t)*2^m. This can be proven number by number and verified has been up to about 5 million. But because it is so the transition step is still unknown obviously a pair orbit, for example we can see the number 10087 which is somewhat long in iterations until it reaches the expression (10087-2399)*2^3 for iteration 168 (The longest until observed, which equals the expression).
That is, in iteration 168 a connection occurs with the number 7688 via powers of 2, in this case 2^3. This alone is elegant, but the most interesting thing is raising the problem based on this. That is, if I start from the pure algebraic expression and replant a diophantic equation for example 3(2n+1)+1=((2n+1)-t)*2^m, what happens to the solutions?. Well these are in the form of a+2^ku where a is the starting value. For example, for the first iteration would be 5+2^2u, so such infinite solutions would be 5,9,13,... The search process is tedious and computer application.
In addition to iterations, you have to consider the parity chain of iterations, each of these presents a solution to a certain equation. The method would seem simple, for short iterations values it is not extremely complicated. But from certain iterations the thing changes a lot... The powerful thing about the method is that for iterations not more than 31 and not considering them all in iteration and parity you reach a coverage density more than excellent 93.16... %. But finding a structure step by step is very complicated and requires a lot of computational effort and even that 6.84.. % seems little, mathematically it's a lot. Would be interesting a computational effort but still a complicated undertaking.. As a personal comment we would say that Collatz's conjecture is more complex the more we want to know about it.