- Source: Covering system
In mathematics, a covering system (also called a complete residue system) is a collection
{
a
1
(
mod
n
1
)
,
…
,
a
k
(
mod
n
k
)
}
{\displaystyle \{a_{1}{\pmod {n_{1}}},\ \ldots ,\ a_{k}{\pmod {n_{k}}}\}}
of finitely many residue classes
a
i
(
mod
n
i
)
=
{
a
i
+
n
i
x
:
x
∈
Z
}
,
{\displaystyle a_{i}{\pmod {n_{i}}}=\{a_{i}+n_{i}x:\ x\in \mathbb {Z} \},}
whose union contains every integer.
Examples and definitions
The notion of covering system was introduced by Paul Erdős in the early 1930s.
The following are examples of covering systems:
{
0
(
mod
3
)
,
1
(
mod
3
)
,
2
(
mod
3
)
}
,
{\displaystyle \{0{\pmod {3}},\ 1{\pmod {3}},\ 2{\pmod {3}}\},}
{
1
(
mod
2
)
,
2
(
mod
4
)
,
4
(
mod
8
)
,
0
(
mod
8
)
}
,
{\displaystyle \{1{\pmod {2}},\ 2{\pmod {4}},\ 4{\pmod {8}},\ 0{\pmod {8}}\},}
{
0
(
mod
2
)
,
0
(
mod
3
)
,
1
(
mod
4
)
,
5
(
mod
6
)
,
7
(
mod
12
)
}
.
{\displaystyle \{0{\pmod {2}},\ 0{\pmod {3}},\ 1{\pmod {4}},\ 5{\pmod {6}},\ 7{\pmod {12}}\}.}
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
n
i
{\displaystyle n_{i}}
are different (and bigger than 1). Hough and Nielsen (2019) proved that any distinct covering system has a modulus that is divisible by either 2 or 3.
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.
A system (i.e., an unordered multi-set)
{
a
1
(
mod
n
1
)
,
…
,
a
k
(
mod
n
k
)
}
{\displaystyle \{a_{1}{\pmod {n_{1}}},\ \ldots ,\ a_{k}{\pmod {n_{k}}}\}}
of finitely many residue classes is called an
m
{\displaystyle m}
-cover if it covers every integer at least
m
{\displaystyle m}
times, and an exact
m
{\displaystyle m}
-cover if it covers each integer exactly
m
{\displaystyle m}
times. It is known that for each
m
=
2
,
3
,
…
{\displaystyle m=2,3,\ldots }
there are exact
m
{\displaystyle m}
-covers which cannot be written as a union of two covers. For example,
{
1
(
mod
2
)
;
0
(
mod
3
)
;
2
(
mod
6
)
;
0
,
4
,
6
,
8
(
mod
10
)
;
{\displaystyle \{1{\pmod {2}};\ 0{\pmod {3}};\ 2{\pmod {6}};\ 0,4,6,8{\pmod {10}};}
1
,
2
,
4
,
7
,
10
,
13
(
mod
15
)
;
5
,
11
,
12
,
22
,
23
,
29
(
mod
30
)
}
{\displaystyle 1,2,4,7,10,13{\pmod {15}};\ 5,11,12,22,23,29{\pmod {30}}\}}
is an exact 2-cover which is not a union of two covers.
The first example above is an exact 1-cover (also called an exact cover). Another exact cover in common use is that of odd and even numbers, or
{
0
(
mod
2
)
,
1
(
mod
2
)
}
.
{\displaystyle \{0{\pmod {2}},\ 1{\pmod {2}}\}.}
This is just one case of the following fact: For every positive integer modulus
m
{\displaystyle m}
, there is an exact cover:
{
0
(
mod
m
)
,
1
(
mod
m
)
,
…
,
m
−
1
(
mod
m
)
}
.
{\displaystyle \{0{\pmod {m}},\ 1{\pmod {m}},\ \ldots ,\ {m-1}{\pmod {m}}\}.}
Mirsky–Newman theorem
The Mirsky–Newman theorem, a special case of the Herzog–Schönheim conjecture, states that there is no disjoint distinct covering system. This result was conjectured in 1950 by Paul Erdős and proved soon thereafter by Leon Mirsky and Donald J. Newman. However, Mirsky and Newman never published their proof. The same proof was also found independently by Harold Davenport and Richard Rado.
Primefree sequences
Covering systems can be used to find primefree sequences, sequences of integers satisfying the same recurrence relation as the Fibonacci numbers, such that consecutive numbers in the sequence are relatively prime but all numbers in the sequence are composite numbers. For instance, a sequence of this type found by Herbert Wilf has initial terms
a1 = 20615674205555510, a2 = 3794765361567513 (sequence A083216 in the OEIS).
In this sequence, the positions at which the numbers in the sequence are divisible by a prime p form an arithmetic progression; for instance, the even numbers in the sequence are the numbers ai where i is congruent to 1 mod 3. The progressions divisible by different primes form a covering system, showing that every number in the sequence is divisible by at least one prime.
Boundedness of the smallest modulus
Paul Erdős asked 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; a suitable cover is 0(3), 0(4), 0(5), 1(6), 1(8), 2(10), 11(12), 1(15), 14(20), 5(24), 8(30), 6(40), 58(60), 26(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, and Pace P Nielsen demonstrates the existence of an example with N = 40, consisting of more than
10
50
{\displaystyle 10^{50}}
congruences. Tyler Owens demonstrates the existence of an example with N = 42.
Erdős's question was resolved in the negative by Bob Hough. Hough used the Lovász local lemma to show that there is some maximum N<1016 which can be the minimum modulus on a covering system.
Systems of odd moduli
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. It is known that if such a system exists with square-free moduli, the overall modulus must have at least 22 prime factors.
See also
Chinese remainder theorem
Covering set
Residue number system
References
External links
Zhi-Wei Sun: Problems and Results on Covering Systems (a survey) (PDF)
Zhi-Wei Sun: Classified Publications on Covering Systems(PDF) Archived 2007-09-29 at the Wayback Machine
Kata Kunci Pencarian:
- Perang Dunia I
- Sambungan Keselamatan Sistem Nama Domain
- Israel
- Latinisasi bahasa Bulgaria
- Gunung Asfiksia
- Observatorium Lowell
- Apel
- SICPA
- Apple Inc.
- Baterai listrik
- Covering system
- Covering space
- Modular arithmetic
- Covering lemma
- Residue number system
- Complete residue system
- Polygon covering
- Set cover problem
- Window covering
- Chinese remainder theorem
