Exact Polynomial Families Solving the Erdos-Straus Equation
Bilal Ghermoul

TL;DR
This paper constructs explicit polynomial families that generate infinite classes of integers for which the Erdős–Straus conjecture holds, providing computational evidence and new approaches towards solving the conjecture.
Contribution
The authors introduce four explicit unbounded polynomial families that produce integers satisfying the Erdős–Straus conjecture, covering all relevant cases up to very large bounds.
Findings
Polynomials generate all integers of the form 4q+1 up to 10^9.
One polynomial generates all such primes up to 1.2×10^{10}.
Computational evidence supports the conjecture's validity for these families.
Abstract
The Erd\H{o}s-Straus conjecture, proposed in 1948 by Paul Erd\H{o}s and Ernst G. Straus, asks whether the Diophantine equation \[ \frac{4}{a} = \frac{1}{b} + \frac{1}{c} + \frac{1}{d} \] admits positive integer solutions for every integer . While the conjecture has been confirmed for all even integers and for all integers congruent to , the case remains the central open challenge. In this work, we construct four explicit unbounded multivariable polynomials with , such that each of the first three -- when inserted into the form -- always produces values of for which the Erd\H{o}s--Straus equation admits an explicit solution. Thus, the first three polynomials individually satisfy the conjecture for all their outputs. We further…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Cryptography and Residue Arithmetic · Algebraic Geometry and Number Theory
