ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let

Φ(x):=∑k=1⌊x⌋φ(k)\Phi(x):=\sum_{k=1}^{\lfloor x\rfloor}\varphi(k)

be the number of positive Farey fractions of order ⌊x⌋\lfloor x\rfloor, and define the remainder

E(x):=Φ(x)−3π2x2.E(x):=\Phi(x)-\frac{3}{\pi^2}x^2.

Here f(x)=Ω±(g(x))f(x)=\Omega_{\pm}(g(x)) means that, for some positive constant cc, the inequality f(x)>c∣g(x)∣f(x)>c\lvert g(x)\rvert holds infinitely often and the inequality f(x)<−c∣g(x)∣f(x)<-c\lvert g(x)\rvert also holds infinitely often.

Montgomery's conjectures. As x→∞x\to\infty, the remainder satisfies

E(x)=O(xlog⁡log⁡x),E(x)=O(x\log\log x),

and has maximal order of magnitude

E(x)=Ω±(xlog⁡log⁡x).E(x)=\Omega_{\pm}(x\log\log x).

These conjectures concern the sharp order of the error term in the summatory totient function. The source presents them as conjectures formulated by Montgomery in 1987, while noting that the best known upper and lower bounds at the time were respectively O(x(log⁡x)2/3(log⁡log⁡x)4/3)O\bigl(x(\log x)^{2/3}(\log\log x)^{4/3}\bigr) and Ω±(xlog⁡log⁡x)\Omega_{\pm}(x\sqrt{\log\log x}).

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.