← All problems

The 2n + 13 Conjecture / The ' Siddharth ' Conjecture

Let T(n)=S(2n+13)T(n) = S(2n + 13) be an arithmetic function defined for integers n∈Zn \in \mathbb{Z}, where S(x)S(x) represents the sum of the digits of xx in base 10.

Experimental brute-force verification using a Python interpreter across integers shows that repeatedly iterating T(n)T(n) causes all trajectories (with the sole exception of n=−13n = -13) to eventually get trapped into one of three deterministic attracting loops:

  1. The Fixed Point (Hole 1): A stable attractor at 55, where T(5)=S(2(5)+13)=S(23)=5T(5) = S(2(5)+13) = S(23) = 5.
  2. The 8-11 Oscillator: A two-cycle loop alternating continuously between 88 and 1111:
8→11→8→…8 \to 11 \to 8 \to \dots
  1. The Grand Circle: A 6-cycle periodic loop containing the elements:
6→7→9→4→3→10→66 \to 7 \to 9 \to 4 \to 3 \to 10 \to 6

Conjecture: Except for n=−13n = -13, the trajectory of every integer under the iteration of T(n)T(n) 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

Refreshed
Open

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.