Solution of the minimum modulus problem for covering systems
DOI10.4007/annals.2015.181.1.6zbMath1344.11015arXiv1307.0874OpenAlexW2963381034MaRDI QIDQ482915
Publication date: 6 January 2015
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.0874
probabilistic methodLovász local lemmacovering system of congruencesdistinct moduliminimum modulus problemodd moduli
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Congruences; primitive roots; residue systems (11A07) Arithmetic progressions (11B25) Combinatorial aspects of packing and covering (05B40)
Related Items (19)
Uses Software
Cites Work
- Some unsolved problems
- A covering system whose smallest modulus is 40
- A covering system with least modulus 25
- Sieving by large integers and covering systems of congruences
- Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
- New bounds for $\psi (x)$
- Covering the Set of Integers by Congruence Classes of Distinct Moduli
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Solution of the minimum modulus problem for covering systems