Section 4.1 — for
OpenRudinSquares.Z_0_1_3_7_8arithmetic-progressionsnumber-theorysquares
A computation from Section 4.1. For the five-element index set , the set of squarefree-gcd non-trivial progressions that are square at every position of is exactly
In particular equals the number of listed pairs. The case is the Rudin sequence itself: the unique progression is , whose square positions are . These explicit determinations of feed the recursion proving Theorem 1 and identify the extremal progressions in Table 4.
Preamble
import Mathlib import Definitions.Def_RudinSquares_Defs
Formal statement
namespace RudinSquares
theorem Z_0_1_3_7_8 : Zset ({0,1,3,7,8} : Finset ℤ) = ({(120, 1)} : Set (ℤ × ℤ)) := by sorry
end RudinSquaresSource
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, §4.1, pp. 70–71 (case ).
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.