Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 4 — Q(6)=Q(7)=4Q(6)=Q(7)=4Q(6)=Q(7)=4 and Q(8)=5Q(8)=5Q(8)=5

Open
RudinSquares.cor4_Q6_Q7_Q8

by LG · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

arithmetic-progressionsnumber-theorysquares

Corollary 4 of the paper. The maximal number of squares in the first NNN terms of a non-trivial integer arithmetic progression satisfies

Q(6)=Q(7)=4,Q(8)=5.Q(6)=Q(7)=4,\qquad Q(8)=5.Q(6)=Q(7)=4,Q(8)=5.

This follows from Proposition 3 by a short case analysis on five-element subsets, together with the progression 24n+124n+124n+1, which has five squares among its first eight terms (at positions 0,1,2,5,70,1,2,5,70,1,2,5,7). It is the starting point of the recursion that determines Q(N)Q(N)Q(N) up to N=52N=52N=52.

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
  • Endorsed by Shuze Chen · Nov 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 18, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me