# Extreme Covering Systems of the Integers

**Authors:** Jack Dalton, Ognian Trifonov

arXiv: 1905.07386 · 2022-02-11

## TL;DR

This paper establishes lower bounds on the largest modulus and the least common multiple for covering systems of integers with specific minimal moduli, providing optimal constants for these bounds.

## Contribution

It proves new lower bounds on the largest modulus and LCM in covering systems with minimal moduli 3 and 4, establishing their optimality.

## Key findings

- Largest modulus at least 60 when minimal modulus is 4
- LCM at least 120 when minimal modulus is 3
- LCM at least 360 when minimal modulus is 4

## Abstract

It is proved that if the least modulus of a distinct covering system is 4, its largest modulus is at least 60; also if the least modulus is 3, the LCM of the moduli is at least 120; finally, if the least modulus is 4, the LCM of the moduli is at least 360. The constants 60, 120, and 360 can not be replaced by larger constants.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1905.07386/full.md

## References

18 references — full list in the complete paper: https://tomesphere.com/paper/1905.07386/full.md

---
Source: https://tomesphere.com/paper/1905.07386