The 2n + 13 Conjecture / The ' Siddharth ' Conjecture
Let be an arithmetic function defined for integers , where represents the sum of the digits of in base 10.
Experimental brute-force verification using a Python interpreter across integers shows that repeatedly iterating causes all trajectories (with the sole exception of ) to eventually get trapped into one of three deterministic attracting loops:
- The Fixed Point (Hole 1): A stable attractor at , where .
- The 8-11 Oscillator: A two-cycle loop alternating continuously between and :
- The Grand Circle: A 6-cycle periodic loop containing the elements:
Conjecture: Except for , the trajectory of every integer under the iteration of enters one of these three periodic cycles in a finite number of steps.
Note : In the 3rd loop the number sequence order might change for different numbers the author is not sure for infinity of the order will change
References
https://zenodo.org/records/20355398 -( 2026) (10.5281/zenodo.20355398)
Progress summary
No public proof, counterexample, or substantive progress on this digit-iteration conjecture was found.
No public discussion or published progress was found.
Current status (as of November 2026): The conjecture appears open, with no recorded public activity.
Solutions 0
No solutions have been posted yet.