ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T(n)T(n) denote the minimal length of a corresponding sequence for the non-negative integer nn.

Infinitude conjecture. For each positive integer t≠2t\neq 2, the set

{n∈N≥0∣T(n)=t}\{n\in\mathbb{N}_{\geq 0}\mid T(n)=t\}

is infinite.

This is presented as a stronger conjecture than the claim that T(n)T(n) is unbounded and takes every positive-integer value other than 22. The paper notes that examples are known for every t≤14t\leq 14 with t≠2t\neq 2, and that computation gives T(n)<15T(n)<15 for all n≤10000n\leq 10000; the infinitude assertion remains open in the supplied text.

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.