Asymptotic order of the number of lengths with 2^e very odd sequences
Statement
Let denote the number of integers for which , and let be the parameter used in the paper to state the preceding bounds. Suppose that . The order-of-growth conjecture. As ,
The conjecture asserts matching upper and lower orders for these counting functions, sharpening the preceding theorem's bounds. The paper gives no resolution of this assertion.
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.