Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Structured residues
The following are proved special cases. They do not cover arbitrary moving residues. Throughout, is the decreasing limit of the densities of the original finite delayed survivor systems.
We use the multiples theorem and finite-periodic logarithmic approximation: for and finite ,
The relevant Davenport–Erdős 1951 source passage, equations (2), (4), and (8)–(12), was checked. Alternatively, (1) follows from the self-contained association proof in basic reductions.
Finite rational slopes with integer translations
Theorem. Suppose each original congruence belongs to one of finitely many fixed patterns
where the triples are fixed integers with and . Then . In particular, this holds when the normalized ratios belong to a fixed finite subset of .
Proof. Fix a triple. Write uniquely , where every prime factor of divides , and . Partition further by and . Let be the set of in one such group, and define its actual delayed union
Apart from the finitely many , its full congruence union is
Indeed, for with , the congruence is equivalent to . For finite , all its original congruences are active once . Therefore, up to finitely many exceptions,
For fixed , summing the absolutely summable difference shows that a positive affine image of a set with logarithmic density has logarithmic density . Thus (1) makes the last tail arbitrarily small in upper logarithmic density.
There are infinitely many possible , but their omitted groups have a uniform natural-density bound. Each deleted integer in an -group satisfies and . Consequently
The series over these smooth converges, with total . First truncate , then finitely approximate each remaining -group, and finally take the finite union over the original triples. The omitted deletion set then has arbitrarily small upper logarithmic density. An original initial segment contains every chosen finite collection, so
Finite periodic recovery proves the theorem.
Finite fixed rational translates
Theorem. Suppose finitely many fixed pairs $(b_j,c_j)\in\mathbb Z\times \mathbb N$ are given, and each modulus has an assigned pair satisfying
Then .
Proof. First, a primitive set has logarithmic density zero: its tail is contained in , whose logarithmic density tends to zero by (1).
Fix one pair and its modulus set . Put
For a finite initial part , define likewise. Substitution gives
Here one can use and bound the sum over its single congruence class of by the unrestricted positive sum. Hence has finite-periodic logarithmic approximation.
Let be the minimal generators of under divisibility. Then is primitive and . If is not deleted by any active modulus, choose dividing . Necessarily . Writing gives , so all sufficiently large such exceptions belong to a finite union of affine images
Each has logarithmic density zero. The actual delayed union is contained in outside the finitely many with , and the reverse inclusion fails only on the null exceptional set just bounded. Finite unions preserve both conclusions. Finite truncations have the same eventual periodic densities as the corresponding , so the limiting survivor density is .
Rational congruence patterns without coprimality
Theorem. Fix finitely many pairs . Suppose each modulus is assigned a pair satisfying
No assumption on is needed. The delayed union has finite-periodic approximation in upper logarithmic density, and the survivor set has logarithmic density .
This strengthens the preceding rational-translate theorem and subsumes the finite rational-slope theorem. It results from checking the affine endpoint argument in Section 8 of the independent input.
Proof. Fix . Write , where every prime factor of divides and . Partition further by the normalized residue , . Necessarily , so for each there are at most possible .
For fixed , write , with . The substitution identifies the exclusions exactly with
Activation is exact because . The quotient moduli are distinct in this group, and are coprime to . Thus the preceding rational-translate theorem gives finite-periodic logarithmic approximation for the group. Its positive affine image retains that property.
The groups with have a uniform counting bound. Each deleted integer in such a group satisfies and , so there are at most hits below for each possible . Hence
The sum tends to zero, being a tail of the finite Euler product . First truncate , then finitely approximate the remaining groups. A finite union over the pairs proves the assertion.
Consequence for affine endpoints
Suppose increase, , and for . If the pairs lie in finitely many fixed rational affine relations
then has logarithmic density zero.
For one relation put . Then , so (2) applies to its delayed union . Every endpoint is in , whereas every fixed finite prefix meets in only finitely many points by the avoidance condition. Finite-periodic approximation gives
Take the finite union of the relation-subsequences. This verifies the independent note's special case, including bounded choices of or , but not arbitrary or approximately affine endpoints.
Stability under multipliers congruent to one
The abstract lemma in Section 8.6 of the second independent record is valid. Its application to bounded residue orders is already covered by (2), but the following formulation also permits nonperiodic sets.
Theorem. Fix and put . Suppose satisfies
Then can be approximated from within, in upper logarithmic density, by finite unions of rays with . In particular has logarithmic density. No natural-density conclusion is asserted.
Proof. Let consist of the positive integers supported on primes dividing , including . Write each integer uniquely as , with and . For a fixed and a unit residue , put
Then
Indeed, if , with and , invertibility of gives , so (3) applies. The reverse inclusion in (4) is the only nontrivial one.
By the multiples approximation (1), choose finite so that has arbitrarily small logarithmic density. Intersecting with can only decrease its harmonic mass, and
After dilation by , this gives the required approximation in one stratum: dilation divides upper logarithmic density by .
The unretained strata with have harmonic mass at most
This tail tends to zero after normalization, since
There are finitely many remaining -strata. Approximate each by finitely many rays, then take their union. Every ray is eventually periodic, so these approximations squeeze the upper and lower logarithmic densities of to the same value. For , take the single stratum ; this recovers the multiples theorem.
Congruence consequence. Suppose for a fixed . More generally than in Problem 25, allow repeated moduli and any finite activation thresholds , and set
Each satisfies (3): multiplication by preserves its congruence and cannot move a positive integer below its threshold. Hence has the ray approximations above. For each selected ray , choose one original containing . That entire ray lies in , so any finite ray approximation is contained in a finite original prefix. The prefixes therefore approximate in upper logarithmic density. Its density equals their limiting periodic density.
For the original activation, this is not a new positive regime: is (2) with , or equivalently for normalized residues. Likewise Section 8.5's bounded representatives are already covered by the finitely many pairs . The multiplier theorem supplies an alternative structural proof, not a resolution for arbitrary residues.
Coherent profinite residues: only a partial reduction
If all residues come from one , any modulus that is a multiple of an earlier modulus is redundant, even with delayed activation. Thus the modulus set may be replaced by its primitive core. Its logarithmic density is zero by (1). For each fixed , the union of its first activated hits per modulus has harmonic mass at most . This controls bounded quotients only; it does not prove the full coherent case.
The later coherent power-cutoff estimate controls conditioned tails with for every fixed . It proves natural density under power-delayed activation, and under the original activation when the primitive core has counting function . Unrestricted coherent residues remain unresolved; the possible excess is confined to unbounded but subpower quotients.
One cannot simply remove activation for a general profinite . Choose increasing primes with , and prescribe by CRT. The fully active integer trace contains every positive integer. The delayed union instead has natural density , by the summable case.