ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each integer n≥2n\ge 2, choose an integer dd with 1≤d≤n−11\le d\le n-1 and gcd⁡(n,d)=1\gcd(n,d)=1, and let s(n,d)s(n,d) denote the sum of the quotients obtained by running the Euclidean algorithm on (n,d)(n,d). Euclidean quotient-sum conjecture. There is an absolute constant cc such that, for every n≥2n\ge 2, some such dd satisfies

s(n,d)≤clog⁡n.s(n,d)\leq c\log n.

The paper's preceding theorem gives the weaker bound cnϕ(n)log⁡nlog⁡log⁡nc\frac{n}{\phi(n)}\log n\log\log n; removing the factor nϕ(n)log⁡log⁡n\frac{n}{\phi(n)}\log\log n 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 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.