The bounded Syracuse falling-time conjecture
Statement
Let be the Syracuse map on odd positive integers, and let denote the Syracuse falling time of an odd integer , namely the least positive number of Syracuse iterations needed to reach a value below . Bounded Syracuse falling-time conjecture. There exists such that
for all .
This conjecture seeks a uniform bound for Syracuse falling times on the residue class . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.