ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp run over primes, let phiphi denote Euler's totient function, and let [y][y] denote the integer part of yy. As x→∞x\to\infty, consider the sum

∑p≤xϕ([xp]).\sum_{p\le x}\phi\biggl(\biggl[\frac{x}{p}\biggr]\biggr).

Asymptotic formula.

∑p≤xϕ([xp])∼1ζ(2)xlog⁡log⁡x.\sum_{p\le x}\phi\biggl(\biggl[\frac{x}{p}\biggr]\biggr)\sim \frac{1}{\zeta(2)}x\log\log x.

The preceding theorem gives upper and lower bounds with constants differing from 1/ζ(2)1/\zeta(2) by fixed multiples of 1−1/ζ(2)1-1/\zeta(2) and 1/ζ(2)1/\zeta(2), respectively. The authors state that proving the asymptotic formula is currently out of reach because of difficulties in estimating the relevant exponential sums.

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.