The quadratic-case divisor-sum conjecture
Statement
Let be a prime, and let be the set of divisors of satisfying
Consider the normalized divisor sum
Quadratic-case divisor-sum conjecture. As ,
where is probably of order .
This claim is based on numerical experiments in the quadratic case and concerns an upper bound for the density of primes with . The phrase “probably” makes the proposed size of 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.