Covering systems with restricted divisibility
In 1950 P. Erdős introduced the notion of a covering system as a system of finitely many congruences \(a_i \pmod{n_i}\), \(i=1,\dots,k\), such that every integer satisfies at least one of them. Shortly after this he and J. L. Selfridge conjectured that in every covering system there are either two moduli equal or there is a modulus even (for the history of covering systems cf. the reviewer's paper [Mitt. Math. Semin. Gießen 150, 85 p. (1981; Zbl 0479.10032)]). The conjecture is still open. In the paper under review the authors prove that in a covering system with all the moduli distinct there is a modulus divisible by either 2 or 3. The main ingredients of the ingenious proof are Lovász local lemma and Shearer-type theorem arguments.
- Covering Systems of Congruences
- Covering systems in number fields
- Covering systems with odd moduli
- Distinct covering systems in number fields
- On disjoint covering systems with precisely one repeated modulus
- Covering systems of homogeneous congruences
- Disjoint covering systems with precisely one multiple modulus
- scientific article; zbMATH DE number 24314
- Exact covering systems in number fields
- Disjoint Covering Systems of Congruences
- A covering system whose smallest modulus is 40
- An improvement of the Lovász local lemma via cluster expansion
- Approximate formulas for some functions of prime numbers
- Explicit estimates of some functions over primes
- scientific article; zbMATH DE number 3063030 (Why is no real title available?)
- Necessary conditions for distinct covering systems with square-free moduli
- On a problem of Spencer
- On an irreducibility theorem of A. Schinzel associated with coverings of the integers
- On odd covering systems with distinct moduli
- Sieving by large integers and covering systems of congruences
- Solution of the minimum modulus problem for covering systems
- Sur un problème concernant les nombres \(k\cdot 2^n + 1\)
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
- Unsolved problems in number theory
- A covering system whose smallest modulus is 40
- The Erdős-Selfridge problem with square-free moduli
- On the Erdős covering problem: the density of the uncovered set
- Covering systems with odd moduli
- Covering intervals with arithmetic progressions
- Erdős covering systems
- On odd covering systems with distinct moduli
- Exact covering systems in number fields
- Two questions concerning covering systems
- A covering system with least modulus 25
- Covering subsets of the integers by congruences
- scientific article; zbMATH DE number 3877298 (Why is no real title available?)
- Consecutive primes which are widely digitally delicate
- Disjoint covering systems with precisely one multiple modulus
- Mean and Variance for Covering Sets of Congruences
- scientific article; zbMATH DE number 1944019 (Why is no real title available?)
- scientific article; zbMATH DE number 1995865 (Why is no real title available?)
- Solution of the minimum modulus problem for covering systems
- On a problem of P. Erdos and S. Stein
- Covering Systems of Congruences
- The structure and number of Erdős covering systems
- An upper bound for the minimum modulus in a covering system with squarefree moduli
- A question of Erdős and Graham on covering systems
- Covering systems with the sum of the reciprocals of the moduli close to 1
This page was built for publication: Covering systems with restricted divisibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286326)
