Conjecture on polylogarithmically many solutions to σ(n)=kn+a
Statement
Let denote the sum-of-divisors function. For integers , , and satisfying
consider the solutions of . Polylogarithmic solution-count conjecture. The number of such solutions is
where the implied constant and are absolute constants. The conjecture refines expectations about the number of solutions to generalized divisor-sum equations after excluding the problematic cases and ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.