Two questions concerning covering systems

DOI10.1142/S179304211550075XMaRDI QIDQ2942539zbMATH OpenFDO

Authors Joshua Harrington

Publication date 11 September 2015

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

Full work available at URL https://doi.org/10.1142/S179304211550075X

zbMATH Keywords

covering systemsminimum modulus problemodd coveringSierpiński number

Mathematics Subject Classification ID

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

Recommendations

• Covering systems with odd moduli
• The Erdős-Selfridge problem with square-free moduli
• A covering system whose smallest modulus is 40
• Covering systems with restricted divisibility
• Erdős covering systems

Cites work

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

Cited in

(7)

• The Erdős-Selfridge problem with square-free moduli
• Covering systems with odd moduli
• Covering subsets of the integers by congruences
• Solution of the minimum modulus problem for covering systems
• On binomial coefficients associated with Sierpiński and Riesel numbers
• scientific article; zbMATH DE number 7640035 (Why is no real title available?)
• Arbitrarily long sequences of Sierpiński numbers that are the sum of a Sierpiński number and a Mersenne number

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942539)