Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T23:47:25.327Z Has data issue: false hasContentIssue false

On a conjecture of Rudin on squares in arithmetic progressions

Published online by Cambridge University Press:  01 April 2014

Enrique González-Jiménez
Affiliation:
Universidad Autónoma de Madrid Departamento de Matemáticas and Instituto de Ciencias Matemáticas (ICMat), Madrid, Spain email enrique.gonzalez.jimenez@uam.es
Xavier Xarles
Affiliation:
Departament de Matemàtiques Universitat Autònoma de Barcelona, 08193 Bellaterra Barcelona, Catalonia email xarles@mat.uab.cat

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let $Q(N;q,a)$ be the number of squares in the arithmetic progression $qn+a$ , for $n=0$ , $1,\ldots,N-1$ , and let $Q(N)$ be the maximum of $Q(N;q,a)$ over all non-trivial arithmetic progressions $qn + a$ . Rudin’s conjecture claims that $Q(N)=O(\sqrt{N})$ , and in its stronger form that $Q(N)=Q(N;24,1)$ if $N\ge 6$ . We prove the conjecture above for $6\le N\le 52$ . We even prove that the arithmetic progression $24n+1$ is the only one, up to equivalence, that contains $Q(N)$ squares for the values of $N$ such that $Q(N)$ increases, for $7\le N\le 52$ ( $N=8,13,16,23,27,36,41$ and $52$ ).

Supplementary materials are available with this article.

Information

Type
Research Article
Copyright
© The Author(s) 2014 
Supplementary material: File

González-Jiménez and Xarles Supplementary Material

Supplementary Material

Download González-Jiménez and Xarles Supplementary Material(File)
File 37.5 MB