Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Coherent logarithmic criterion
This is a proved sufficient condition for the original activation rule, not a solution of the unrestricted coherent or arbitrary-residue problem.
The logarithmic criterion
Let be a set of moduli, let be its primitive core, and fix a coherent center . Suppose
Then the delayed union
has logarithmic density . It has finite-periodic approximation in upper logarithmic density. The conclusion holds for every coherent center, not just integer centers.
Deleting nonminimal multiples changes neither the full nor the delayed union, so work with . If is the least full covering modulus, put, for ,
The power-cutoff theorem proves that has natural, hence logarithmic, density . Every point of in the -cell satisfies . Write the normalized residue as and , with . Summing over all possible quotients, whether or not they are first kills, gives
The activation condition is essential to here.
Primitive sets have logarithmic density zero, as proved in structured residues. Thus . Writing , (2) yields
Let . Fixed finite prefixes give the reverse lower bound, proving the claimed logarithmic density. For a finite prefix , subtracting its periodic harmonic asymptotic gives
This tends to zero as the prefix is exhausted, proving the approximation statement. No natural-density conclusion for is asserted.
A finite small-footprint consequence
For a finite coherent primitive family, put . The exact multiples comparison gives . The finite power-cutoff bound and (2) consequently imply
In particular, if , optimizing gives
For the parameter range where the suggested optimizer exceeds , the trivial bound one implies (4) after enlarging . An empty family is treated separately. Thus (4) is a uniform finite harmonic small-footprint bound under a bounded weighted reciprocal hypothesis.
The condition permits failure of natural density
There are primitive sets satisfying (1) but failing the reciprocal-shell condition used in the earlier natural-density theorem. Here is a deterministic recursive example.
Fix . Having chosen finite blocks , let be their common period, taking . Choose the least integer satisfying
omitting conditions involving at the first stage. Such choices exist by the uniform multiples-window bound, which holds along all sufficiently large multiples of . Set
No two numbers in one block divide one another, and the definition prevents divisibility from an older block. Hence is primitive. Its full multiples footprint is at most .
The old multiples union is -periodic with density . The interval is an exact union of periods, so
On the other hand . Geometric growth of in (5) therefore gives, for all ,
For any fixed , put . Eventually , so the entire th block lies in . Equation (6) shows that the reciprocal-shell limsup is at least , independently of . Thus the natural-density criterion does not apply.
For the zero center, the multiples union itself has upper natural density at least , by counting below . Its logarithmic density equals , so natural density does not exist (natural density, if present, would equal logarithmic density). Nevertheless (1) proves logarithmic density for every coherent center on this same modulus set. This example distinguishes the two density conclusions; it is not a counterexample to Problem 25.