A covering system is a finite collection of arithmetic progressions whose union is the set of integers. The study of covering systems with distinct moduli was initiated by Erdős in 1950, and over the following decades numerous problems were posed regarding their properties. One particularly notorious question, due to Erdős, asks whether there exist covering systems whose moduli are distinct and all odd. We show that if in addition one assumes the moduli are square-free, then there must be an even modulus
A theorem of Davenport, Mirsky, Newman and Rado shows that there does not exist an exact covering sy...
AbstractIn this papar, the main results concern Natural Exactly Covering Systems (NECS's)(2) (i.e., ...
AbstractTextPaul Erdős, in 1950, asked whether for each positive integer N there exists a finite set...
A covering system is a finite collection of arithmetic progressionswhose union is the set of integer...
AbstractA famous unsolved conjecture of P. Erdős and J.L. Selfridge states that there does not exist...
A covering system or a covering is a set of linear congruences such that every integer satisfies at ...
A covering system or a covering is a set of linear congruences such that every integer satisfies at ...
The work in this thesis is based on a paper written by Bob Hough in 2013. This thesis addresses the ...
The work in this thesis is based on a paper written by Bob Hough in 2013. This thesis addresses the ...
Since their introduction by Erdős in 1950, covering systems (that is, finite collections of arithmet...
In this paper, we study necessary conditions for small sets of congruences with distinct moduli to c...
In 1950 Erdos made the following conjecture ($1000 reward for a solution): Given an integer {\it m\/...
A covering system is a finite collection of arithmetic progressions whose union is the set of intege...
In 1950 Erdos made the following conjecture ($1000 reward for a solution): Given an integer {\it m\/...
100 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006.A collection of congruences w...
A theorem of Davenport, Mirsky, Newman and Rado shows that there does not exist an exact covering sy...
AbstractIn this papar, the main results concern Natural Exactly Covering Systems (NECS's)(2) (i.e., ...
AbstractTextPaul Erdős, in 1950, asked whether for each positive integer N there exists a finite set...
A covering system is a finite collection of arithmetic progressionswhose union is the set of integer...
AbstractA famous unsolved conjecture of P. Erdős and J.L. Selfridge states that there does not exist...
A covering system or a covering is a set of linear congruences such that every integer satisfies at ...
A covering system or a covering is a set of linear congruences such that every integer satisfies at ...
The work in this thesis is based on a paper written by Bob Hough in 2013. This thesis addresses the ...
The work in this thesis is based on a paper written by Bob Hough in 2013. This thesis addresses the ...
Since their introduction by Erdős in 1950, covering systems (that is, finite collections of arithmet...
In this paper, we study necessary conditions for small sets of congruences with distinct moduli to c...
In 1950 Erdos made the following conjecture ($1000 reward for a solution): Given an integer {\it m\/...
A covering system is a finite collection of arithmetic progressions whose union is the set of intege...
In 1950 Erdos made the following conjecture ($1000 reward for a solution): Given an integer {\it m\/...
100 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006.A collection of congruences w...
A theorem of Davenport, Mirsky, Newman and Rado shows that there does not exist an exact covering sy...
AbstractIn this papar, the main results concern Natural Exactly Covering Systems (NECS's)(2) (i.e., ...
AbstractTextPaul Erdős, in 1950, asked whether for each positive integer N there exists a finite set...