ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let syr⁡\operatorname{syr} be the Syracuse map on odd positive integers, and let sft⁡(n)\operatorname{sft}(n) denote the Syracuse falling time of an odd integer n≥3n\geq 3, namely the least positive number of Syracuse iterations needed to reach a value below nn. Bounded Syracuse falling-time conjecture. There exists C≥10C\geq 10 such that

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

for all n≡3(mod4)n\equiv 3\pmod 4.

This conjecture seeks a uniform bound for Syracuse falling times on the residue class 3(mod4)3\pmod 4. Computations establish bounds for a large finite range and for the known glide records, while the asserted global bound remains 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.