ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk be an integer and consider the congruence

σ(n)≡k(modn),\sigma(n)\equiv k\pmod n,

where σ(n)\sigma(n) is the sum of the positive divisors of nn. A solution is regular if n=pmn=pm, where pp is prime, p∤mp\nmid m, m∣σ(m)m\mid\sigma(m), and σ(m)=k\sigma(m)=k; all other solutions are called sporadic. Let x≥3x\geq 3.

Anavi–Pollack–Pomerance conjecture. Uniformly for integers kk satisfying ∣k∣≤x/2|k|\leq x/2, the number of sporadic solutions n≤xn\leq x is at most (log⁡x)O(1)(\log x)^{O(1)}.

This conjecture would substantially improve the known bounds for sporadic solutions, which are currently of power-saving type in ranges of kk. 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 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.