Certificate-backed lower bounds for AlphaEvolve Problem 6.60, through C(20) >= 50
-
Updated
Aug 20, 2026 - Python
#
mathematical-certificates
Here are 2 public repositories matching this topic...
A class-wide exact-two obstruction for modulus 9 in finite odd covering systems, established through a computer-assisted mathematical proof with exact certificates and reproducible verification.
mathematics verification modular-arithmetic number-theory computer-assisted-proof congruences exact-computation mathematical-research obstruction-theory residue-classes reproducible-mathematics finite-certificates covering-systems mathematical-certificates shunyaya combinatorial-number-theory covering-congruences odd-covering-systems modulus-9 nonexistence-theorems
-
Updated
Sep 12, 2026 - Python
Add this topic to your repo
To associate your repository with the mathematical-certificates topic, visit your repo's landing page and select "manage topics."