Distinct covering systems of period dividing 45 times a power of two
For every positive integer a, there is no finite distinct covering system with minimum modulus 6 whose moduli all divide 45 times 2^a. This gives a negative answer to Problem 2 of Harrington, Klein, Lowrance and Trifonov (arXiv:2605.18644). A weighted bound rules out every finite continuation of a state and reduces the unbounded dyadic exponent to an exhaustive check of finitely many states. The ZIP contains the note, certificate data, a minimum-5 witness of period 1440, and a standalone verifier using Python and C++20. The verifier uses exact integer arithmetic. Run python3 verify.py after extraction. The files passed internal verification and are provided for independent review.
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.24420166
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint