A logarithmic upper bound for Collatz total stopping time
Statement
For , let be the least such that , and let be a slowly varying function, possibly eventually constant. The logarithmic stopping-time conjecture.
Such a bound would control the total stopping time of every Collatz trajectory by a slowly varying multiple of logarithmic growth. The paper presents this as an unproved conjectural assertion; no resolution is supplied.
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.