A finite algebraic covering system for the Erdos-Straus conjecture, verified to 10^11 (max A = 359); exploratory search to 1.2x10^12 finds A = 479. Gateway decompositions via divisors of N^2.
pythonproofmathematicsdiscrete-mathematicsgpu-accelerationmodular-arithmeticprime-numbersnumber-theoryconjectureegyptian-fractionscomputational-number-theorydiophantine-equationscomputational-verificationopen-problemerdos-straus
-
Updated
Aug 1, 2026 - Python