← All problems

Mersenne-triplet admissibility conjecture

Less than 1 year old · traced to

Let p≥2p\geq 2. The triplet (2p−1,2p−1,1)+(2^{p-1},2^{p}-1,1)_{\pmb{+}} is an admissible triplet, with order and admissibility as specified below. Its trivial cycle is

Ω(1)=(1→2→22→…→2p−1→1).\Omega(1)=(1\rightarrow 2\rightarrow 2^2\rightarrow\ldots\rightarrow 2^{p-1}\rightarrow 1).

Mersenne-triplet admissibility conjecture. For all p≥2p\geq 2, (2p−1,2p−1,1)+(2^{p-1},2^{p}-1,1)_{\pmb{+}} is an admissible triplet of order one. It is strongly admissible only for p=2p=2 and weakly admissible for all p≥3p\geq 3.

The case p=2p=2 recovers the classical Collatz triplet, while the theorem immediately preceding the conjecture establishes the displayed cycle. The asserted classification of strong versus weak admissibility remains unresolved in the supplied source.

References
  1. Abderrahman Bouhamidi, “Weakly and Strongly Admissible Triplets for a Collatz-Type Map”, arXiv:2601.17573 (2026).

Progress summary

Refreshed
Open

A paper proves the advertised cycle but leaves its proposed classification unresolved, and no later proof or counterexample was found.

The conjecture asserts that, for every p≥2p \ge 2, the triplet (2p−1,2p−1,1)+(2^{p-1},2^p-1,1)_{\pmb{+}} has order one, is strongly admissible only at p=2p=2, and is weakly admissible otherwise. The source presents this as Conjecture 3.1 and explicitly leaves even the classical case open.

Known results

  • The cycle Ω(1)=(1→2→22→…→2p−1→1)\Omega(1)=(1\rightarrow 2\rightarrow 2^2\rightarrow\ldots\rightarrow 2^{p-1}\rightarrow 1) is proved for every p≥2p \ge 2.

Current status (as of October 2026): The displayed cycle is proved for every p≥2p \ge 2, but the asserted order-one and strong/weak classification remains open; no claimed solution or counterexample was found.

Sources

Solutions 0

No solutions have been posted yet.