Rudin's conjecture is a mathematical conjecture in additive combinatorics and elementary number theory about an upper bound for the number of squares in finite arithmetic progressions. The conjecture, which has applications in the theory of trigonometric series, was first stated by Walter Rudin in his 1960 paper Trigonometric series with gaps.^[1][2][3]

For positive integers ${\displaystyle N,q,a}$ define the expression ${\displaystyle Q(N;q,a)}$ to be the number of perfect squares in the arithmetic progression ${\displaystyle qn+a}$, for ${\displaystyle n=0,1,\ldots ,N-1}$, and define ${\displaystyle Q(N)}$ to be the maximum of the set {Q(N; q, a) : q, a ≥ 1} . The conjecture asserts (in big O notation) that ${\displaystyle Q(N)=O({\sqrt {N}})}$ and in its stronger form that, if ${\displaystyle N>6}$, ${\displaystyle Q(N)=Q(N;24,1)}$.^[3]

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.

• v
• t
• e