ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let σ(n)\sigma(n) denote the sum-of-divisors function. For integers k≥2k\geq 2, x≥3x\geq 3, and a∈Za\in\mathbb{Z} satisfying

∣a∣≤x2,|a|\leq \frac{x}{2},

consider the solutions n≤xn\leq x of σ(n)=kn+a\sigma(n)=kn+a. Polylogarithmic solution-count conjecture. The number of such solutions is

≪(log⁡x)C,\ll (\log x)^C,

where the implied constant and CC are absolute constants. The conjecture refines expectations about the number of solutions to generalized divisor-sum equations after excluding the problematic cases k=0k=0 and k=1k=1; the source later shows that this bound fails, so the conjecture is refuted.

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.