Unbounded-orbit conjecture for the quadratic Collatz-type recursion
Statement
Let the quadratic Collatz-type recursion be the recursion referred to as , with orbits under its iteration. Unbounded-orbit conjecture. The recursion has an unbounded orbit. This is motivated by the recursion's quadratic growth in the odd case and by the apparent balance between division by and squaring. The preceding theorem shows that every orbit either reaches a cycle or is unbounded, but does not establish that any unbounded orbit exists.
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.