covering-systems

Here are 3 public repositories matching this topic...

Sanexxxx777 / erdos-computational-bounds

SAT + verified LRAT certificate for a covering-system lower bound (Erdős #273), plus a segmented sieve extending verified ranges for #385 and #647 to 1.0011e12

mathematics computational-mathematics reproducibility formal-verification number-theory sat erdos cadical lrat covering-systems

Updated Jul 22, 2026
Python

Aperturesurvivor / irdcs-divisible-by-4

Star

Explicit verified IRDCS on [1,344] with every modulus divisible by 4

computational-mathematics combinatorics number-theory covering-systems

Updated Aug 9, 2026
Python

ibrahimmian36 / centurion

Star

Kernel-checked Lean 4 exclusions for the Erdős–Selfridge odd covering problem (Erdős #7): any covering of ℤ by distinct odd moduli > 1 has lcm > 10000.

theorem-proving lean formal-verification number-theory mathlib lean4 formalized-mathematics erdos-problems covering-systems

Updated Sep 4, 2026
Lean

Add this topic to your repo

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

Learn more