ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers aa and bb, consider positive solutions of x2≡a(modb)x^2\equiv a\pmod b. The congruence-spacing conjecture. There exists a constant NN such that, for every aa and bb, there do not exist more than NN solutions

0<x1<x2<⋯<xN<x1+b1/20<x_1<x_2<\cdots<x_N<x_1+b^{1/2}

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 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.