ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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

sft⁡(n)≤2\operatorname{sft}(n)\leq 2

for all odd n≥25000n\geq 2^{5000}.

This conjecture is the Syracuse analogue of the large-number falling-time bound and is motivated by computational evidence and heuristics for very large odd integers. Its truth beyond the tested finite range 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.