Theorem 1 — Strong and Super-Strong Rudin conjectures up to
OpenRudinSquares.theorem1arithmetic-progressionsnumber-theoryrudin-conjecturesquares
The main result of the paper (Theorem 1), in two parts. Let be the maximum number of squares among the first terms of a non-trivial integer arithmetic progression, and the number of squares among , . Write for the generalized pentagonal numbers.
(S) Strong Rudin conjecture, verified range. For every integer with ,
(SS) Super-Strong Rudin conjecture, verified range. If for some integer , then for all integers with squarefree and ,
Thus in the verified range the progression is extremal, and at the jump lengths it is the unique extremal progression (with squarefree gcd and ). This is the mission's goal theorem.
Preamble
import Mathlib import Definitions.Def_RudinSquares_Defs
Formal statement
namespace RudinSquares
theorem theorem1 :
(∀ N : ℕ, 6 ≤ N → N ≤ 52 → Q N = Qap N 24 1) ∧
(∀ N : ℕ, (∃ k : ℤ, (N : ℤ) = GP k + 1 ∧ 8 ≤ N ∧ N ≤ 52) →
∀ q a : ℤ, Squarefree (Int.gcd q a) → 0 ≤ q →
(Q N = Qap N q a ↔ q = 24 ∧ a = 1)) := 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, Theorem 1, p. 59.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.