Two questions concerning covering systems

DOI10.1142/S179304211550075XzbMath1394.11002MaRDI QIDQ2942539

Joshua Harrington

Publication date: 11 September 2015

Published in: International Journal of Number Theory (Search for Journal in Brave)

zbMATH Keywords

covering systemsminimum modulus problemSierpiński numberodd covering

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Arithmetic progressions (11B25)

Related Items (4)

On binomial coefficients associated with Sierpi\'{n}ski and Riesel numbers ⋮ Covering systems with odd moduli ⋮ Unnamed Item ⋮ Covering subsets of the integers by congruences

Cites Work

• Solution of the minimum modulus problem for covering systems
• A covering system whose smallest modulus is 40
• On integers of the forms \(k-2^n\) and \(k2^n+1\)
• On odd covering systems with distinct moduli
• The distance to an irreducible polynomial, II
• A polynomial investigation inspired by work of Schinzel and Sierpiński

This page was built for publication: Two questions concerning covering systems