ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be a prime, and let Dp{\mathcal D}_p be the set of divisors DD of p2−1p^2-1 satisfying

D<p,D∤p−1,D∤p+1.D<p,\qquad D\nmid p-1,\qquad D\nmid p+1.

Consider the normalized divisor sum

1p−1∑D∈Dpϕ(D).\frac{1}{p-1}\sum_{D\in\mathcal D_p}\phi(D).

Quadratic-case divisor-sum conjecture. As p→∞p\to\infty,

13≤1p−1∑D∈Dpϕ(D)<c(p) log⁡2(p),\frac{1}{3}\leq \frac{1}{p-1}\sum_{D\in\mathcal D_p}\phi(D)<c(p)\,\log^2(p),

where c(p)c(p) is probably of order O(log⁡2(p))O(\log_2(p)).

This claim is based on numerical experiments in the quadratic case and concerns an upper bound for the density of primes with op(η)<po_p(\eta)<p. The phrase “probably” makes the proposed size of c(p)c(p) heuristic rather than an independently asserted theorem.

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.