COVERING SYSTEM
In mathematics, a 'covering system' is a collection
:
of finitely many
residue classes
whose union ''covers'' all the integers.
The notion of covering system was introduced by Paul Erdős in the early 1930s.
For example:
:
and
:
and
:
A covering system is called disjoint (or exact) if no two members overlap.
A covering system is called distinct (or incongruent) if all the moduli are different (and bigger than 1).
A covering system is called irredundant (or minimal) if all the residue classes are required to cover the integers.
The first two examples are disjoint.
The third example is distinct.
The following problem from Paul Erdős is unsolved: Whether for any arbitrarily large ''N'' there exists
an incongruent covering system the minimum of whose moduli is at least ''N''. It is easy to construct examples where the minimum of the moduli in such a system is 2, or 3 (Erdős gave an example where the moduli are in the set of the divisors of 120 ); D. Swift gave an example where the minimum of the moduli is 4 (and the moduli are in the set of the divisors of 2880). S. L. G. Choi proved that it is possible to give an example for ''N'' = 20.
In another problem we want that all of the moduli (of an incongruent covering system) be odd. There is a famous unsolved conjecture from Erdős and Selfridge: an incongruent covering system (with the minimum modulus greater than 1) whose moduli are odd, does not exist [1].
★ Chinese remainder theorem
★ Residue number system
★ Herzog-Schönheim conjecture
★ Zhi-Wei Sun: Classified Publications on Covering Systems (PDF)
:
of finitely many
residue classes
whose union ''covers'' all the integers.
The notion of covering system was introduced by Paul Erdős in the early 1930s.
For example:
:
and
:
and
:
A covering system is called disjoint (or exact) if no two members overlap.
A covering system is called distinct (or incongruent) if all the moduli are different (and bigger than 1).
A covering system is called irredundant (or minimal) if all the residue classes are required to cover the integers.
The first two examples are disjoint.
The third example is distinct.
| Contents |
| Some unsolved problems |
| See also |
| External links |
Some unsolved problems
The following problem from Paul Erdős is unsolved: Whether for any arbitrarily large ''N'' there exists
an incongruent covering system the minimum of whose moduli is at least ''N''. It is easy to construct examples where the minimum of the moduli in such a system is 2, or 3 (Erdős gave an example where the moduli are in the set of the divisors of 120 ); D. Swift gave an example where the minimum of the moduli is 4 (and the moduli are in the set of the divisors of 2880). S. L. G. Choi proved that it is possible to give an example for ''N'' = 20.
In another problem we want that all of the moduli (of an incongruent covering system) be odd. There is a famous unsolved conjecture from Erdős and Selfridge: an incongruent covering system (with the minimum modulus greater than 1) whose moduli are odd, does not exist [1].
See also
★ Chinese remainder theorem
★ Residue number system
★ Herzog-Schönheim conjecture
External links
★ Zhi-Wei Sun: Classified Publications on Covering Systems (PDF)
This article provided by Wikipedia. To edit the contents of this article, click here for original source.
psst.. try this: add to faves

العربية
ä¸å›½
Français
Deutsch
Ελληνική
हिनà¥à¤¦à¥€
Italiano
日本語
Português
РуÑÑкий
Español