The congruence-spacing conjecture for square roots modulo integers
Statement
For integers and , consider positive solutions of . The congruence-spacing conjecture. There exists a constant such that, for every and , there do not exist more than solutions
to this congruence. The source notes that this would imply Rudin's square-counting conjecture for arithmetic progressions, while only weaker logarithmic bounds are proved.
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.