Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. The remark on p. 78 (physical p. 2 of the scan) that any homogeneous cover of extends trivially to for every , by reading each congruence as one in variables with all but two coefficients . The paper defines a cover of only loosely there ("distinct moduli and appropriate GCD conditions on the coefficients"); the statement below makes the condition primitivity of each coefficient-and-modulus tuple. The matrix version is not stated in the paper; it and its block-matrix proof are the corpus's own addition.
T. Cochrane and G. Myerson, Covering congruences in higher dimensions, Rocky Mountain J. Math. 26 (1996), no. 1, 77–81, doi:10.1216/rmjm/1181072104; the edition read and its page mapping are named on the source card.
Statement
For every , there is a finite family of primitive homogeneous linear congruences in variables, with distinct moduli greater than one, that covers .
There is also a finite -cover by integer matrices whose determinants have pairwise distinct absolute values, all greater than one.
Proof
For each congruence
in the two-dimensional homogeneous cover, use in variables the coefficient vector
Every satisfies one of these congruences because its first two coordinates satisfy one from the original cover. Adding zero coefficients does not change the greatest common divisor with , and the moduli remain distinct.
For the matrix version, take the matrices constructed in the two-dimensional matrix corollary and form
Given an integer row vector , choose and an integer row vector with . Then
Thus the form an -cover. Finally, , so their determinant magnitudes remain distinct and greater than one.
Bears on. Higher-dimensional variants of covering congruences; no new one-dimensional covering-system conclusion is asserted.