Skip to content

Navigation Menu

Sign in
Sign up
#

open-problem

Here are 2,059 public repositories matching this topic...

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.

  • Updated Aug 1, 2026
  • Python

Add this topic to your repo

To associate your repository with the open-problem topic, visit your repo's landing page and select "manage topics."

Learn more

AltStyle によって変換されたページ (->オリジナル) /