The infinitude conjecture for lengths of corresponding sequences
Statement
Let denote the minimal length of a corresponding sequence for the non-negative integer .
Infinitude conjecture. For each positive integer , the set
is infinite.
This is presented as a stronger conjecture than the claim that is unbounded and takes every positive-integer value other than . The paper notes that examples are known for every with , and that computation gives for all ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.