Arbitrarily large pair-sum collisions in a cube class of quartics
ProvedErdos324.linear_quartic_cube_class_cofinaldiophantine-equationsnumber-theorysidon-sets
Fix an integer in the progression with , and suppose is the cube of a rational number. Put . For every natural cutoff there are integers with and . The coefficient stays fixed as varies.
Preamble
import Mathlib
Formal statement
theorem Erdos324.linear_quartic_cube_class_cofinal (d : ℤ)
(hsize : d ≤ -379828253655132800)
(hres : (-d) % 2220222977058240 = 170124578173760)
(hcube : ∃ q : ℚ, (d : ℚ) / (-349520) = q^3) (N : ℕ) :
let f : ℕ → ℤ := fun x => (x : ℤ)^4 + d * (x : ℤ)
∃ a r s b : ℕ,
N < a ∧ a < r ∧ r < s ∧ s < b ∧
(N : ℤ) < f a ∧ f a < f r ∧ f r < f s ∧ f s < f b ∧
f a + f b = f r + f s := by sorrySource
Restricted results concerning Erdős problem 324, https://www.erdosproblems.com/324. John Leech, Some solutions of Diophantine equations (1957), https://doi.org/10.1017/S0305004100032850, supplied the classical equal-fourth-powers seed for the progression. Lander and Parkin, Equal Sums of Biquadrates (1966), Table I, row 5, https://www.jstor.org/stable/2003608, tabulate it. Browning, The polynomial sieve and equal sums of like polynomials, §3, equation (3.1), https://arxiv.org/abs/1306.6767, gives related coordinates for counting collisions. Matt directed the investigation. OpenAI Codex (Astra) developed the constructions and Lean proofs. Related earlier theorem for x^4+c x^2: https://prove2.me/theorems/46859084-43bf-49ae-8031-cf56665d52f9