ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SS be a Collatz sequence containing the trivial cycle, and, disregarding that cycle, let e(mk)e(m_k) and o(mk)o(m_k) denote respectively the numbers of even and odd terms in the sequence beginning at mkm_k, counting mkm_k but not 11. Define the completeness of mkm_k by

C(mk):=o(mk)e(mk).C(m_k):=\frac{o(m_k)}{e(m_k)}.

Bounded completeness conjecture. For all mk>1m_k>1, there exists a constant Cmax⁡C_{\max} such that

C(mk)<Cmax⁡<log⁡2log⁡3.C(m_k)<C_{\max}<\frac{\log 2}{\log 3}.

A prior result cited in the paper proves the weaker bound C(mk)<log⁡2/log⁡3C(m_k)<\log 2/\log 3. The conjecture asserts a uniform strict upper bound below that threshold and is motivated by the suggested boundedness of the related quantity Γ(mk)=e(mk)/log⁡mk\Gamma(m_k)=e(m_k)/\log m_k.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.