Covering Sets of Congruences

From MaRDI portal





Let \(1<n_1<n_2<\ldots <n_k\) be integers and \(0\leq b_i<n_i\) for each \(i\). Then the set of ordered pairs \(\{(b_1,n_1),\ldots,(b_k,n_k)\}\) of integers is said to form a covering set of congruences if \(z\equiv b_i\pmod{n_i}\) is solvable for at least one value of \(i\) for every integer \(z\). Further, a covering set of congruences is said to be a minimal covering if deletion of any ordered pair \((b_i,n_i)\) results in the remaining set of ordered pairs \(\{(b_1,n_1),\ldots,(b_{i-1},n_{i-1}) (b_{i+1},n_{i+1}),\ldots, (b_k,n_k)\}\) failing to constitute a covering set of congruences. In this paper the authors establish various results about minimal coverings, and one of the most interesting is the following theorem: Let \(p\) be a prime with \(p^c\| n_i\) for some value of \(i\) while \(p^{c+1}\nmid n_j\) holds for all values of \(j\). Then \(p^c\| n_j\) for at least \(p\) values of \(j\).











This page was built for publication: Covering Sets of Congruences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5183567)