← All problems

The Siddharth Cycle Conjecture

TITLE: (The Siddharth Cycle Conjecture)

AUTHOR: Siddharth Sivasubramaniyam ORCID: 0009-0000-4360-2675 link text

STATEMENT OF THE CONJECTURE: Let E(x) be the arithmetic function that counts the total number of even integers strictly contained within the open interval (x, x²). For any positive integer x ≥ 3, the value of the secondary parity split E(x) / 2 yields a non-integer fraction if and only if: x ≡ 0 (mod 4) OR x ≡ 3 (mod 4)

INITIAL DATA STREAM (x = 3 to 14): x=3 -> 1.5 (Fraction) x=4 -> 2.5 (Fraction) x=5 -> 5.0 (Whole Number) x=6 -> 7.0 (Whole Number) x=7 -> 10.5 (Fraction) x=8 -> 13.5 (Fraction) x=9 -> 18.0 (Whole Number) x=10 -> 22.0 (Whole Number) x=11 -> 27.5 (Fraction) x=12 -> 32.5 (Fraction) x=13 -> 39.0 (Whole Number) x=14 -> 45.0 (Whole Number)

BEHAVIORAL PROPERTIES: The resultant sequence generates a rigid, infinite 4-step structural wave ticking through the pattern [Fraction, Fraction, Whole, Whole]. Computational brute-force validation has confirmed zero counterexamples up to x = 100,000 and verified stability for multi-digit integers (e.g., x = 20292829922973737). The parity wave is structurally bounded by the base-4 modular classification of squares.

References

NA

Progress summary

Refreshed
Open

No public discussion or published progress on this 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.