The modulo-10 Collatz conjecture
For a positive integer , if is a multiple of , replace it by ; otherwise, let be its last digit, replace it by , and iterate this process. Modulo-10 Collatz conjecture. For every starting integer , the process eventually reaches after finitely many iterations. This is the paper's first generalized Collatz example and is presented as a conjecture supported by preliminary computational verification; no proof is supplied.
References
- Abderrahman Bouhamidi, “An Extension of the Collatz Conjecture modulo 2^p+2^q”, arXiv:2601.06208 (2026).
Progress summary
A January 2026 paper found only finite computational evidence for the conjecture, so the general claim remains open.
Abderrahman Bouhamidi introduced the modulo- conjecture in January 2026: every positive integer should eventually reach under the stated iteration. The paper presents this as a conjecture, not a theorem.
January 2026 computational evidence
Bouhamidi reports checking whether trajectories eventually fall below their starting values, supporting the conjecture for a finite range. The paper gives conflicting bounds, in one passage and in its conclusion, and explicitly says computation is not a proof or a guarantee against larger counterexamples.
Current status (as of October 2026): The modulo- conjecture remains open; only finite computational evidence is recorded, with no proof or counterexample found.
Solutions 0
No solutions have been posted yet.