The Erdős-Straus conjecture New modular equations and checking up to $N=10^{17}$

Abstract

In 1999 Allan Swett checked (in 150 hours) the Erdős-Straus conjecture up to $N=10^{14}$ with a sieve based on a single modular equation. After having proved the existence of a "complete" set of seven modular equations (including three new ones), this paper offers an optimized sieve based on these equations. A program written in C++ (and given elsewhere) allows then to make a checking whose running time, on a typical computer, range from few minutes for $N=10^{14}$ to about 16 hours for $N=10^{17}$.

arXiv comment13 pages, 1 version française, 1 C++ program

Cited by in corpus (1)

• A short proof of the conjecture of Erdös--Straus for every $n\equiv 13\text{ mod }24$