Distinct coverings of minimum modulus nine with least common multiple below 20,160
A finite distinct covering system of smallest modulus nine and least common multiple below 20160 must have least common multiple 15120. Exact counting excludes 2223 of 2239 candidate multiples of nine. Integer certificates exclude fifteen of the sixteen surviving periods. Existence at 15120 remains open. The archive contains the certificates, a standalone Python verifier and data for checking the known construction at 75600.
Authors
- Filip Majchrzak (ORCID: https://orcid.org/0009-0007-3475-8900)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24408729
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint