Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Repeated pair sums in every tail of n4+cn2n^4+c n^2n4+cn2

Proved
Erdos324.fourth_power_quadratic_perturbation_tail

by Mceppaglia · Nov 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

diophantine-equationsnumber-theorysidon-sets

Fix any integer ccc and put fc(n)=n4+cn2f_c(n)=n^4+c n^2fc​(n)=n4+cn2. For every natural number NNN there are four pairwise distinct natural numbers a,b,r,sa,b,r,sa,b,r,s above NNN, with a<ba<ba<b and r<sr<sr<s, such that fc(a)+fc(b)=fc(r)+fc(s)f_c(a)+f_c(b)=f_c(r)+f_c(s)fc​(a)+fc​(b)=fc​(r)+fc​(s). Thus every tail of this polynomial family has repeated pair sums. The general existence question of Erdős problem 324 remains open.

Preamble
import Mathlib
Formal statement
theorem Erdos324.fourth_power_quadratic_perturbation_tail (c : ℤ) (N : ℕ) :
    ∃ a b r s : ℕ, N < a ∧ a < b ∧ N < r ∧ r < s ∧
      a ≠ r ∧ a ≠ s ∧ b ≠ r ∧ b ≠ s ∧
      (a : ℤ)^4 + c*(a : ℤ)^2 + ((b : ℤ)^4 + c*(b : ℤ)^2) =
      (r : ℤ)^4 + c*(r : ℤ)^2 + ((s : ℤ)^4 + c*(s : ℤ)^2) := by sorry
Source
Restricted case of Erdős and Graham, Old and New Problems and Results in Combinatorial Number Theory (1980), p. 53, https://www.erdosproblems.com/324. Matt selected this family and directed the investigation. OpenAI Codex developed the construction and Lean proof presented here. Browning, The polynomial sieve and equal sums of like polynomials, §3, (3.1), https://arxiv.org/abs/1306.6767, provides the underlying difference identity. Ulas, On certain diophantine equations related to triangular and tetrahedral numbers, Theorem 5.3, https://arxiv.org/abs/0811.2477, covers the coefficient -2 and hence its square multiples by dilation. The pure fourth-power identity is classical.

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