pith. sign in

arxiv: 1406.6851 · v1 · pith:BR5KXG24new · submitted 2014-06-26 · 🧮 math.NT

On Primitive Covering Numbers

classification 🧮 math.NT
keywords coveringnumberprimitivenumberscertainconditionemphinfinite
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.