ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let sft⁡(n)\operatorname{sft}(n) denote the Syracuse falling time of an odd positive integer nn. Mersenne Syracuse falling-time conjecture.

sft⁡(2ℓ−1)=2\operatorname{sft}(2^{\ell}-1)=2

for all ℓ≥4625\ell\geq 4625.

The assertion agrees with computations through ℓ=500000\ell=500000, following a finite-range pattern in which the Syracuse falling time equals 22 for all tested exponents from 46254625 onward. Its validity for all larger exponents is open.

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.