arXiv Analytics

Sign in

arXiv:1406.6851 [math.NT]AbstractReferencesReviewsResources

On Primitive Covering Numbers

Lenny Jones, Daniel White

Published 2014-06-26Version 1

In 2007, Zhi-Wei Sun defined a \emph{covering number} to be a positive integer $L$ such that there exists a covering system of the integers where the moduli are distinct divisors of $L$ greater than 1. A covering number $L$ is called \emph{primitive} if no proper divisor of $L$ is a covering number. Sun constructed an infinite set $\mathcal L$ of primitive covering numbers, and he conjectured that every primitive covering number must satisfy a certain condition. In this paper, for a given $L\in \mathcal L$, we derive a formula that gives the exact number of coverings that have $L$ as the least common multiple of the set $M$ of moduli, under certain restrictions on $M$. Additionally, we disprove Sun's conjecture by constructing an infinite set of primitive covering numbers that do not satisfy his primitive covering number condition.

Related articles: Most relevant | Search more
arXiv:1201.3168 [math.NT] (Published 2012-01-16)
Practical pretenders
arXiv:1411.6974 [math.NT] (Published 2014-11-25)
Integers with large practical component
arXiv:2311.14021 [math.NT] (Published 2023-11-23)
The fourth positive element in the greedy $B_h$-set