30 problems
Put … where the maximum is taken over all disjoint systems for which . Determine or estimate as well as possible. I could not even decide whether…
Suppose are such that for every choice of the set of integers not satisfying any of the congruences has density 0. In this case we must h…
Let with associated such that the congruence classes are disjoint (that is, every integer is for at most one…
Call distinct integers an irreducible covering set if suitable residue classes modulo them cover every integer, but no proper subset does. Determine the number o…
A congruence class represents the integers congruent to , where and . A finite set of such classes is a minimal distinct covering system if eve…
Let satisfy that is strictly increasing and whenever . For , let be the number of natural numbers…
Let , let , and let , with the moduli not required to be distinct. If there exists an integer such that eve…
Does there exist a natural number and a function such that, writing , both of the following hold? Every…
A Sierpiński number is a positive odd integer for which is composite for every integer . A set of primes is a covering set for if … The question is w…
For a positive integer , integers , and pairwise distinct moduli , write for the residue class . Is there any…
For integers and , write for an arithmetic progression. A covering system here is a finite family ,…
Let . Is there a choice of congruence classes for every prime such that all sufficiently large integers can be written as for some prime and…
Let be a finite set of positive integers. For residues , let … and let denote its natural density in…
For a positive integer , let . Call covering if one can choose a residue for each distinct divisor of so that these residue…
In the question’s terminology, a “Lucas sequence” is a Fibonacci-like sequence: integers satisfying … The literal question is whether there are initial terms f…
The standard precise form is the Herzog–Schönheim question. Let be any group, let be finite, and let be proper subgroups of finite index in . Choo…
A covering system is a finite collection of residue classes whose union is all of . In the standard convention used here, its moduli are distinct. The question is wheth…
Does there exist an integer with such that, for every pair of nonnegative integers , the number is not prime? Equivalently, does the…
Let us now restrict ourselves to a special case. The are the integers between and . First of all denote by the smallest possible value of the density…
A family of residue classes with is called a system of covering congruences if every integer belongs to at least one of the residue classe…
Many further unsolved problems can be asked about covering systems. Selfridge and I asked: Is there a covering system all whose moduli are odd?
A system of congruences … is called a covering system if every integer satisfies at least one of the congruences in (3). The simplest covering system is , ,…
Erdős–Selfridge odd covering problem. Does there exist a covering system of whose moduli are odd, distinct, and greater than ?
A distinct covering system is a covering system whose moduli are distinct integers greater than . Let , let , , and be positive integers, and let denote t…
Lemma nice criterion. If is the smallest prime divisor of and has fewer than distinct prime divisors, then is non-intersecting.