On primitive covering numbers
From MaRDI portal
Publication:3179501
DOI10.1142/S1793042117500038zbMATH Open1419.11019arXiv1406.6851WikidataQ114072004 ScholiaQ114072004MaRDI QIDQ3179501FDOQ3179501
Authors:
Publication date: 21 December 2016
Published in: International Journal of Number Theory (Search for Journal in Brave)
Abstract: In 2007, Zhi-Wei Sun defined a emph{covering number} to be a positive integer such that there exists a covering system of the integers where the moduli are distinct divisors of greater than 1. A covering number is called emph{primitive} if no proper divisor of is a covering number. Sun constructed an infinite set of primitive covering numbers, and he conjectured that every primitive covering number must satisfy a certain condition. In this paper, for a given , we derive a formula that gives the exact number of coverings that have as the least common multiple of the set of moduli, under certain restrictions on . Additionally, we disprove Sun's conjecture by constructing an infinite set of primitive covering numbers that do not satisfy his primitive covering number condition.
Full work available at URL: https://arxiv.org/abs/1406.6851
Recommendations
Enumerative combinatorics (05A99) Congruences; primitive roots; residue systems (11A07) Arithmetic progressions (11B25)
Cites Work
Cited In (2)
This page was built for publication: On primitive covering numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179501)