ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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

Unboundedness and surjectivity conjecture. The function T(n)T(n) is unbounded. Moreover, it is surjective onto the set of positive integers other than 22.

The conjecture is motivated by examples realizing every length t≤14t\leq 14 except t=2t=2, together with computer verification that T(n)<15T(n)<15 for all n≤10000n\leq 10000.

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.