ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For n≥2n\geq2, define the scaled total stopping time by

γ(n)=σ∞(n)ln⁡(n).\gamma(n)=\frac{\sigma_{\infty}(n)}{\ln(n)}.

With a0=2a_0=2, call aka_k the kk-th Abby-Normal number if

γ(ak)=max⁡{γ(n)∣ak−1≤n≤ak},k≥1.\gamma(a_k)=\max\{\gamma(n)\mid a_{k-1}\leq n\leq a_k\},\quad k\geq1.

The Abby-Normal-number conjecture. There exist infinitely many Abby-Normal numbers. The assertion concerns the unbounded sequence of record-setting values of the normalized Collatz stopping time. It is stated without a proof and remains open in the source.

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.