AbstractIn this papar, the main results concern Natural Exactly Covering Systems (NECS's)(2) (i.e., Exactly Covering Systems (ECS's)(2) connected with trees of a certain type), and are as follows: (i) In every NECS(2), the moduli are of the form 2α3β5γ7δ. This is a result in the direction in which Znám made an incorrect conjecture. (ii) The maximal number of disjoint NECS's(2) (i.e., the maximal number of NECS's(2), such that in the set containing all their moduli every modulus occurs at most twice) is six. (iii) In every NECS(2), the smallest modulus is less than 49. This is the first negative result in attempts to find an upper bound for the smallest modulus in general
AbstractIf ni is a modulus of a DCS S, then by the Mycielski's inequality card(S) ⩽ 1 + F(ni) (see e...
The work in this thesis is based on a paper written by Bob Hough in 2013. This thesis addresses the ...
AbstractIf every nonnegative integer occurs in exactly one of the m integer sequences ain#&62; + bi ...
AbstractIn this papar, the main results concern Natural Exactly Covering Systems (NECS's)(2) (i.e., ...
AbstractIn this paper we generalize to NECS's(M), certain results obtained in [2] for NECS's(2), nam...
A covering system or a covering is a set of linear congruences such that every integer satisfies at ...
In 1950 Erdos made the following conjecture ($1000 reward for a solution): Given an integer {\it m\/...
Covering systems were introduced by Erd\H{o}s in 1950. In the same article where he introduced them,...
AbstractTextPaul Erdős, in 1950, asked whether for each positive integer N there exists a finite set...
100 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006.A collection of congruences w...
In this paper, we study necessary conditions for small sets of congruences with distinct moduli to c...
AbstractM. Filaseta, K. Ford, S. Konyagin, C. Pomerance and G. Yu proved that if the reciprocal sum ...
AbstractBerger, Felzenbaum, and Fraenkel characterized all disjoint covering systems with precisely ...
A covering system is a finite collection of arithmetic progressions whose union is the set of intege...
In 1950 Paul Erdos observed that every integer belonged to a certain system of congruences with dist...
AbstractIf ni is a modulus of a DCS S, then by the Mycielski's inequality card(S) ⩽ 1 + F(ni) (see e...
The work in this thesis is based on a paper written by Bob Hough in 2013. This thesis addresses the ...
AbstractIf every nonnegative integer occurs in exactly one of the m integer sequences ain#&62; + bi ...
AbstractIn this papar, the main results concern Natural Exactly Covering Systems (NECS's)(2) (i.e., ...
AbstractIn this paper we generalize to NECS's(M), certain results obtained in [2] for NECS's(2), nam...
A covering system or a covering is a set of linear congruences such that every integer satisfies at ...
In 1950 Erdos made the following conjecture ($1000 reward for a solution): Given an integer {\it m\/...
Covering systems were introduced by Erd\H{o}s in 1950. In the same article where he introduced them,...
AbstractTextPaul Erdős, in 1950, asked whether for each positive integer N there exists a finite set...
100 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006.A collection of congruences w...
In this paper, we study necessary conditions for small sets of congruences with distinct moduli to c...
AbstractM. Filaseta, K. Ford, S. Konyagin, C. Pomerance and G. Yu proved that if the reciprocal sum ...
AbstractBerger, Felzenbaum, and Fraenkel characterized all disjoint covering systems with precisely ...
A covering system is a finite collection of arithmetic progressions whose union is the set of intege...
In 1950 Paul Erdos observed that every integer belonged to a certain system of congruences with dist...
AbstractIf ni is a modulus of a DCS S, then by the Mycielski's inequality card(S) ⩽ 1 + F(ni) (see e...
The work in this thesis is based on a paper written by Bob Hough in 2013. This thesis addresses the ...
AbstractIf every nonnegative integer occurs in exactly one of the m integer sequences ain#&62; + bi ...