Corollary 4 — and
OpenRudinSquares.cor4_Q6_Q7_Q8arithmetic-progressionsnumber-theorysquares
Corollary 4 of the paper. The maximal number of squares in the first terms of a non-trivial integer arithmetic progression satisfies
This follows from Proposition 3 by a short case analysis on five-element subsets, together with the progression , which has five squares among its first eight terms (at positions ). It is the starting point of the recursion that determines up to .
Preamble
import Mathlib import Definitions.Def_RudinSquares_Defs
Formal statement
namespace RudinSquares theorem cor4_Q6_Q7_Q8 : Q 6 = 4 ∧ Q 7 = 4 ∧ Q 8 = 5 := by sorry end RudinSquares
Source
E. González-Jiménez and X. Xarles, 'On a conjecture of Rudin on squares in arithmetic progressions', LMS J. Comput. Math. 17(1) (2014) 58–76, doi:10.1112/S1461157013000259, Corollary 4, p. 60.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.