On the Erdős covering problem: the density of the uncovered set
From MaRDI portal
Publication:2118065
Recommendations
Cites work
- scientific article; zbMATH DE number 3675978 (Why is no real title available?)
- scientific article; zbMATH DE number 3063030 (Why is no real title available?)
- Covering systems with restricted divisibility
- On an irreducibility theorem of A. Schinzel associated with coverings of the integers
- Reducibility of polynomials and covering systems of congruences
- Sieving by large integers and covering systems of congruences
- Solution of the minimum modulus problem for covering systems
- The Erdős-Selfridge problem with square-free moduli
- The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
Cited in
(16)- scientific article; zbMATH DE number 3573944 (Why is no real title available?)
- Covering Systems of Congruences
- On the Erd\H{o}s Covering Problem: the density of the uncovered set
- On Erdős covering systems in global function fields
- Density, forcing, and the covering problem
- The structure and number of Erdős covering systems
- On homogeneous covering congruences
- On a problem of P. Erdos and S. Stein
- On covering systems of polynomial rings over finite fields
- Composite values of shifted exponentials
- Boolean function analogs of covering systems
- On the jth smallest modulus of a covering system with distinct moduli
- scientific article; zbMATH DE number 7640035 (Why is no real title available?)
- Covering intervals with arithmetic progressions
- scientific article; zbMATH DE number 3877298 (Why is no real title available?)
- Erdős covering systems
This page was built for publication: On the Erdős covering problem: the density of the uncovered set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118065)