ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ft⁡(n)\operatorname{ft}(n) denote the falling time associated with the accelerated 3x+13x+1 map. Large-number falling-time conjecture.

ft⁡(n)≤4\operatorname{ft}(n)\leq 4

for all n≥2500n\geq 2^{500}.

This is a strong quantitative form of the Collatz conjecture, motivated by computations and heuristics suggesting that large integers rarely have falling time at least 55. The threshold is supported by extensive finite searches, but the universal assertion 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.