The bounded completeness conjecture for Collatz sequences
Statement
Let be a Collatz sequence containing the trivial cycle, and, disregarding that cycle, let and denote respectively the numbers of even and odd terms in the sequence beginning at , counting but not . Define the completeness of by
Bounded completeness conjecture. For all , there exists a constant such that
A prior result cited in the paper proves the weaker bound . The conjecture asserts a uniform strict upper bound below that threshold and is motivated by the suggested boundedness of the related quantity .
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.