Graph Depth Analysis Reveals Extreme Variation in Total Stopping Times

Two neighboring integers can differ by hundreds of steps to reach 1.

Top Ad Slot
🤯 Did You Know (click to read)

Certain consecutive integers differ by more than 500 steps in total stopping time.

Empirical studies show dramatic variation in total stopping times between adjacent integers. A number and its immediate successor can diverge wildly in trajectory length. One may converge quickly while the other embarks on a thousand-step journey. This sensitivity resembles chaotic dependence on initial conditions. Yet the rule itself contains no randomness. The discontinuity in stopping time distribution resists smooth modeling. No monotonic trend governs convergence speed.

Mid-Content Ad Slot
💥 Impact (click to read)

Such volatility defies intuitive expectations about incremental change. In many systems, small input differences produce small output differences. Collatz frequently violates that principle. The abrupt shifts in stopping time amplify unpredictability. It resembles mathematical turbulence emerging from arithmetic simplicity.

Understanding this variation is essential for bounding arguments. It suggests that local irregularities dominate global trends. The conjecture’s resolution must reconcile these sharp discontinuities. Until then, adjacency offers no safety in prediction. Every integer stands alone against the infinite process.

Source

Eric Roosendaal, Collatz Problem Computational Records

LinkedIn Reddit

⚡ Ready for another mind-blower?

‹ Previous Next ›

💬 Comments