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

Primary source

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

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.