Generalized Collatz convergence and cycle conjecture for the triplets
For , let and define
where denotes the remainder in Euclidean division by . The conjecture has separate assertions for and .
Generalized Collatz convergence and cycle conjecture. For all with , the triplet is strongly admissible of order one, with unique trivial cycle
and for every integer there exists such that . For , is strongly admissible of order two, with trivial cycles and , and for every there exists such that .
This is a generalized Collatz-type convergence claim: it specifies all asserted trivial cycles and requires every positive integer to reach one of their representatives. The supplied source gives no resolution of these assertions.
References
- Abderrahman Bouhamidi, “Weakly and Strongly Admissible Triplets for a Collatz-Type Map”, arXiv:2601.17573 (2026).
Progress summary
A January 2026 preprint provides finite computational evidence for the conjectured cycles, but no proof or counterexample has appeared.
The conjecture asserts that every positive integer reaches the listed cycle for , and reaches one of two listed cycles when . The source labels these assertions as open conjectures.
January 2026 computational checks
The preprint reports tests for , , and ; the case was tested for starting values up to approximately . These computations support the proposed cycle behavior but do not prove convergence for every positive integer or exclude additional cycles.
Current status (as of October 2026): The convergence and cycle-classification assertions for both and remain unproved; only finite computational support is recorded.
Solutions 0
No solutions have been posted yet.