Unboundedness and surjectivity conjecture for corresponding-sequence lengths
Statement
Let denote the minimal length of a corresponding sequence for , where is a non-negative integer.
Unboundedness and surjectivity conjecture. The function is unbounded. Moreover, it is surjective onto the set of positive integers other than .
The conjecture is motivated by examples realizing every length except , together with computer verification that for all .
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.