The large-number falling-time conjecture
Statement
Let denote the falling time associated with the accelerated map. Large-number falling-time conjecture.
for all .
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 . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.