Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source: arXiv v2, pp. 1 and 3, the opening definitions and Definition 2.2.
An arithmetic progression is a residue class , with positive integer modulus . A finite family of such progressions is a covering system when its union is . It is minimal when deleting any member destroys the covering property.
For an indexed finite family
its multiplicity is
Thus a family has distinct moduli exactly when . The indexed form matters for the shifted auxiliary family in Claim 2.1: two shifted occurrences may represent the same residue class, but they retain their indices and hence their stated multiplicity. Repeated occurrences do not change the union, and every subsequent sieve argument applies to an indexed finite family.
For a positive integer , denotes its largest prime factor, with , and is the number of its distinct prime factors. Brackets denote least common multiple. All logarithms in this source unit are natural logarithms.