AbstractM. Filaseta, K. Ford, S. Konyagin, C. Pomerance and G. Yu proved that if the reciprocal sum of the moduli of a covering system is bounded, then the least modulus is also bounded, which confirms a conjecture of P. Erdős and J.L. Selfridge. They also showed that, for K>1, the complement in Z of any union of residue classes r(n)(modn) with distinct n∈(N,KN] has density at least dK for N sufficiently large, which implies a conjecture of P. Erdős and R.L. Graham. In this paper, we extend these results to covering systems of the ring of integers of an arbitrary number field F/Q
AbstractA famous unsolved conjecture of P. Erdős and J.L. Selfridge states that there does not exist...
be a finite system of congruence classes. We refer to n as the modulus of the congruence class a (mo...
AbstractIn this papar, the main results concern Natural Exactly Covering Systems (NECS's)(2) (i.e., ...
AbstractM. Filaseta, K. Ford, S. Konyagin, C. Pomerance and G. Yu proved that if the reciprocal sum ...
Since their introduction by Erdős in 1950, covering systems (that is, finite collections of arithmet...
100 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006.A collection of congruences w...
It is well known that, in an exact covering system in Z, the biggest modulus must be repeated. Very ...
A covering system is a finite collection of arithmetic progressionswhose union is the set of integer...
AbstractTextPaul Erdős, in 1950, asked whether for each positive integer N there exists a finite set...
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\/...
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...
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 ...
AbstractA famous unsolved conjecture of P. Erdős and J.L. Selfridge states that there does not exist...
be a finite system of congruence classes. We refer to n as the modulus of the congruence class a (mo...
AbstractIn this papar, the main results concern Natural Exactly Covering Systems (NECS's)(2) (i.e., ...
AbstractM. Filaseta, K. Ford, S. Konyagin, C. Pomerance and G. Yu proved that if the reciprocal sum ...
Since their introduction by Erdős in 1950, covering systems (that is, finite collections of arithmet...
100 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006.A collection of congruences w...
It is well known that, in an exact covering system in Z, the biggest modulus must be repeated. Very ...
A covering system is a finite collection of arithmetic progressionswhose union is the set of integer...
AbstractTextPaul Erdős, in 1950, asked whether for each positive integer N there exists a finite set...
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\/...
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...
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 ...
AbstractA famous unsolved conjecture of P. Erdős and J.L. Selfridge states that there does not exist...
be a finite system of congruence classes. We refer to n as the modulus of the congruence class a (mo...
AbstractIn this papar, the main results concern Natural Exactly Covering Systems (NECS's)(2) (i.e., ...