The large-number Syracuse falling-time conjecture
Statement
Let denote the Syracuse falling time of an odd positive integer . Large-number Syracuse falling-time conjecture.
for all odd .
This conjecture is the Syracuse analogue of the large-number falling-time bound and is motivated by computational evidence and heuristics for very large odd integers. Its truth beyond the tested finite range is 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.