Anavi–Pollack–Pomerance conjecture on sporadic divisor-sum congruence solutions
Statement
Let be an integer and consider the congruence
where is the sum of the positive divisors of . A solution is regular if , where is prime, , , and ; all other solutions are called sporadic. Let .
Anavi–Pollack–Pomerance conjecture. Uniformly for integers satisfying , the number of sporadic solutions is at most .
This conjecture would substantially improve the known bounds for sporadic solutions, which are currently of power-saving type in ranges of . The source notes that the conjecture is motivated by a heuristic concerning the average number of sporadic solutions.
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.