← All problems

The modulo-10 Collatz conjecture

Less than 1 year old · traced to

For a positive integer n≥1n\geq1, if nn is a multiple of 1010, replace it by n/10n/10; otherwise, let rr be its last digit, replace it by (12n+8r)/10(12n+8r)/10, and iterate this process. Modulo-10 Collatz conjecture. For every starting integer n≥1n\geq1, the process eventually reaches 44 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
  1. Abderrahman Bouhamidi, “An Extension of the Collatz Conjecture modulo 2^p+2^q”, arXiv:2601.06208 (2026).

Progress summary

Refreshed
Open · progress reported

A January 2026 paper found only finite computational evidence for the conjecture, so the general claim remains open.

Abderrahman Bouhamidi introduced the modulo-1010 conjecture in January 2026: every positive integer should eventually reach 44 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, n≤6.5×109n\leq 6.5\times 10^9 in one passage and n≤6.5×106n\leq 6.5\times 10^6 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-1010 conjecture remains open; only finite computational evidence is recorded, with no proof or counterexample found.

Sources

Solutions 0

No solutions have been posted yet.