Euclidean algorithm quotient-sum conjecture
Statement
For each integer , choose an integer with and , and let denote the sum of the quotients obtained by running the Euclidean algorithm on . Euclidean quotient-sum conjecture. There is an absolute constant such that, for every , some such satisfies
The paper's preceding theorem gives the weaker bound ; removing the factor would be best possible in the stated scale and would yield stronger lower bounds for the first missing linear extension number.
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.