On Primitive Covering Numbers
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.
Cite
@article{arxiv.1406.6851,
title = {On Primitive Covering Numbers},
author = {Lenny Jones and Daniel White},
journal= {arXiv preprint arXiv:1406.6851},
year = {2014}
}