ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.