Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Independent investigation of Erdős Problem 25
1. Status and scope
Incomplete: no proof in full generality and no counterexample to the exact statement were obtained. The results below are partial results and restrictions on attempted constructions. Conjectural steps are identified explicitly.
Only the supplied files were used. The supplied problem page and sources were not modified.
The most substantial proved observation is a finite harmonic bound for the first eligible points of each distinct-modulus congruence. It obstructs a direct singleton version of Wang's bounded-quotient deletion epochs. It does not control the points with unbounded quotient , and it does not resolve the conditioned-tail problem.
2. Exact formulation and elementary positive cases
Choose representatives . Then the forbidden set associated with modulus is exactly
This uses the required inclusive activation condition . In particular, removes itself, whereas a nonzero least representative is not removed by its own congruence.
Put
The natural density of a set , when it exists, is . Its lower and upper logarithmic densities are
Logarithmic density exists when these agree. Natural density implies logarithmic density with the same value, by partial summation; the converse does not hold.
Each finite truncation is eventually periodic, with period dividing . Its natural and logarithmic densities therefore agree; call this value . Then
The same inclusion gives . Thus already implies natural and logarithmic density zero. The difficult regime has .
If , natural density exists and equals . The important uniform estimate is
Only moduli at most can contribute. Comparing with the fixed periodic truncation and then sending proves the assertion. This argument does not incorrectly assume countable subadditivity of upper natural density.
For pairwise coprime moduli,
Convergence of the reciprocal sum is covered above; divergence gives . Thus this case also has natural density.
For zero residues, the supplied Davenport--Erdős theorem gives logarithmic density, but natural density can fail. The 1936 source, Theorem 1(a), and the 1951 source, pp. 3--5, were checked. The 1951 proof uses multiplicative harmonic weighting. Its divisibility invariance is not available for arbitrary moving residues.
3. First-kill formulation and the actual gap
Define
These are disjoint and partition . Their eventual periodic densities satisfy
For , let . If the two residues are incompatible modulo , there is no restriction from on . Otherwise, writing , the earlier congruence becomes one forbidden residue modulo
Thus is the image of a finite periodic quotient sieve , and .
Chojecki's supplied source was checked, including Sections 4--7. Its proposed uniform harmonic estimate has an additional charge :
The required global statement
is not proved there or in this investigation. The entropy part alone is harmless; the charge is the missing input.
The tower in that source is a real obstruction to a termwise entropy-only estimate. For , with suitable stated residues, the top first-kill set is
Its density is , but its first point contributes to the harmonic sum. Their ratio is . Consequently a single first-kill spike cannot simply be bounded by a constant times .
4. Proved compression and harmonic bounds
4.1 Prime-coordinate compression
Let be a finite set of moduli, choose one residue for each , and set
Both have periodic natural densities. Then
Proof. In the finite uniform space modulo , use the Chinese remainder decomposition
A class modulo is a product of -adic balls of measures . Fix a prime coordinate and all the other coordinates. The classes present in this fiber have some collection of balls in the remaining coordinate. Replace all their centers by zero. The new balls are nested, so their union has the largest of their individual measures, no more than the old union measure. Integrating over the other coordinates shows that total union measure cannot increase. Repeat for every prime. The resulting classes are the zero classes modulo the same moduli. This proves (4.1). Repeated moduli are permitted in this compression argument.
4.2 Harmonic domination for a set of multiples
For every finite and integer ,
Proof. Discard moduli greater than ; this does not change the left side and can only decrease the density on the right. For every prime , take independent random variables
and let . On integers supported on these primes,
Conditionally on , its law is therefore .
The event is increasing in the prime valuations; is decreasing. Product-measure association gives . Here association can be proved without an external theorem: for increasing bounded functions of one random variable, covariance is nonnegative because
Induction on the finite number of independent coordinates proves the product version; apply it to and .
Finally, , since inclusion-exclusion gives the same finite sum of reciprocal least common multiples for both quantities. Condition on to obtain (4.2).
The product-geometric distribution is the multiplicative weighting in the checked Davenport--Erdős 1951 source. The association argument above is written out independently and supplies the constant one.
4.3 First eligible points
Now normalize , and let
For distinct moduli,
Indeed,
Distinctness is used when the moduli themselves are counted just once inside . The eligibility condition is used in .
This bound applies to an entire finite epoch, regardless of overlap between its blocks. If all proposed deleted endpoints have witnesses with , their normalized harmonic mass cannot remain positive while the total completed footprint tends to zero. Thus a Wang-type singleton replacement retaining bounded endpoint/modulus ratios cannot work.
The estimate does not say that every conceivable counterexample is impossible. Its factor is unbounded, and the relevant tail after conditioning on earlier survivors need not have small ambient footprint.
4.4 Another finite capacity calculation
Suppose contains at least distinct moduli, where are fixed. Any choice of singleton residues satisfies
To see this, let on the finite uniform period space. Then , while
The harmonic sums in parentheses are bounded in terms of , including the range . Cauchy--Schwarz on the support of proves the claim. This calculation independently excludes Wang's footprint at a scale containing a positive proportion of all nearby singleton moduli.
5. A proved restriction on arbitrary common shifts
For integer , define
Uniformly in and intervals of length ,
Thus even arbitrarily large CRT shifts of a dyadic multiples block cannot maintain positive local density on intervals much longer than its moduli.
Proof. Fix a squarefree . For , put
Counting simultaneous congruences gives
For fixed , harmonic summation in residue classes yields uniformly in
where
Indeed, integers with have density ; the resulting divisor sum factors into this product.
Let be the proportion of residues with . Count those residue classes trivially and the others by the preceding incidence bound:
First let , holding fixed.
Next take to be the product of the first primes. For uniform , the indicators are independent, with probability . With ,
Since , Chebyshev gives in probability. Hence . Send and then . This proves (5.1).
Truncation to only reduces these sets, so the upper bound also holds with the exact activation rule.
For completeness, a simpler common-shift restriction is useful. If all moduli are at least and , every eligible point can be written with , and . Thus its total harmonic deletion is at most . A negative shift with costs at most a fixed factor . Large positive representatives do not admit this direct comparison; (5.1) handles their dyadic-window variant instead.
6. Attempted counterexamples and why they did not close
Wang's multi-residue construction
The supplied Wang source was checked in Lemmas 4--7 and Section 4. At scale , it uses approximately auxiliary primes and a modulus for each central label set . It deletes endpoints in a fixed interval above , with completed footprint . Long dyadic epochs and periodic recovery then yield logarithmic oscillation for multi-residue sieves.
There are at most different , but endpoints. Keeping one endpoint per modulus leaves total harmonic mass at most at that scale, which tends to zero rapidly.
Trying to add many distinct moduli with the same prime signature encounters a stronger capacity problem. A signature requires divisibility by . Among nearby integers there are only such moduli, whereas fair labels ask for about endpoints of that signature. In Wang's skeleton is much larger than for central .
Biased labels of probability , rather than , were considered because their pattern frequencies match the divisibility frequencies of ordinary moduli. This suggests a possible matching of endpoint patterns to moduli, but no construction was proved. The corresponding informal anchor calculation has scale
whose logarithm is roughly . This is far slower than Wang's decay. It did not give a summable cost over the required consecutive dyadic epochs. This is a failed heuristic route, not a proved nonexistence theorem.
Replacing repeated 's by distinct multiples preserves containment of completed cylinders, but an endpoint allows only bounded under activation. Moving endpoints much farther out reduces their harmonic weights. No way was found to compensate by many successive eligible points of each refined modulus.
Shifted intervals of multiples
For , assign the common residue . The points are all deleted by eligible singleton congruences. The completed footprint is a translate of the multiples union of , whose density tends to zero. Thus this is a useful natural-density spike.
Its harmonic mass is only of constant size. One needs order consecutive logarithmic scales for a fixed logarithmic-density spike. Small footprint at one scale therefore does not settle the problem. Trying to correlate such footprints by common shifts is obstructed by Sections 4 and 5.
Exact containment of a new full class in the old completed union also cannot help: when a new modulus is active, all earlier moduli are active. Such a class makes no new deletion. A successful variant would require tiny exceptional parts outside the old union, synchronized near the relevant endpoints.
Generalized towers
The prime-power tower can formally be generalized. For an odd top modulus and divisors satisfying suitable congruences, take
If , then on the top class this removes . Different layers have different 2-adic valuations, and some same-layer collisions can use identical residues.
This did not produce a legal global oscillation construction. Shared tower data can kill the proposed first points of other towers. Already the layer modulo , with residue , removes top points with . Restricting all relevant factors to favorable residue classes makes the available tops sparse. No simultaneous lower bound for surviving endpoints and upper bound for total periodic loss was proved.
7. Positive approaches left unproved
A sufficient finite statement would be
This is not proved. It would settle the problem directly: apply it to all installed moduli at most , whose completed union density is at most . The lower logarithmic density of would be at least , matching the upper bound in Section 2.
A related unproved sufficient statement is Dirichlet domination:
Finite approximation would then yield the infinite Dirichlet limit; the same nonnegative-coefficient Tauberian step used in the checked Davenport--Erdős 1936 source would yield logarithmic density.
The proof of (4.2) does not establish either assertion for moving residues: the congruence event is not increasing in prime valuations, and unit residues are not independent coordinates of the weighted integer law. Haar compression alone only gives (4.1); it does not control the harmonic mass of all shifted points.
Small finite checks did not refute (7.1) or (7.2). They provide no proof. A still stronger normalized comparison with the all-zero system was considered and not established. The analogous counting-function comparison is false: for moduli , residues , the delayed union has six points up to 10 and periodic density ; the zero system has five points and density . Thus
One cannot infer a weighted rearrangement from an unweighted one.
A proved auxiliary zero-residue estimate is, for finite with ,
For the lower bound, partition by the first dividing generator . The quotient avoids a finite multiples union. Davenport--Erdős Dirichlet domination makes its Dirichlet probability at least its natural density . Its contribution is at least . Sum over . This auxiliary bound did not extend to shifted classes.
Finally, conditioning on a finite old period transforms a modulus on a surviving fiber into . Repeated quotient moduli can occur, with multiplicity bounded in terms of the divisors of ; activation can start below that quotient modulus by a factor depending on . The elementary resulting estimates have constants growing with . There is no justification for assuming those constants times tend to zero.
8. An isolated-endpoint question and a proved special case
A narrower unproved target arose:
Must have upper logarithmic density zero? No answer in this generality was obtained.
The 's are distinct. With residue , each is hit by exactly one eligible congruence. Earlier ones are excluded by (8.1). If and , both lie in , so congruence modulo would force equality. If , that later class is inactive.
The corresponding full cylinders form an antichain under containment, but this weaker property is insufficient. The deficient moduli admit greedy residues avoiding every proper-divisor cylinder: at stage , those cylinders occupy at most
residues. These moduli have positive lower density: averaging gives at most , so Markov gives lower density at least for deficiency. This example does not avoid non-divisor-related earlier classes and is not a counterexample to (8.1).
Proved special case. If the pairs in (8.1) lie in finitely many fixed rational affine relations
with fixed positive integers and fixed integer , their endpoint set has logarithmic density zero.
Proof. Work in one relation. If and , then
is divisible by , contradicting (8.1). Let be the part of supported on primes dividing . Fix , and write , . Any divisibility chain of these 's has length at most : a longer chain contains two elements equal modulo , whose quotient is . Coloring by maximal chain length ending at an element partitions the set into at most primitive sets.
Every primitive set has logarithmic density zero by Davenport--Erdős: its tail lies in its full multiples union minus a finite-prefix multiples union, whose logarithmic densities differ by a quantity tending to zero. Thus the moduli with bounded have logarithmic density zero. The rest have upper density at most
which tends to zero, since the total sum is a finite Euler product. The whole modulus subsequence consequently has logarithmic density zero. Finally,
Take the finite union of the affine subsequences.
This includes bounded choices of or . Approximate affine relations do not preserve the exact congruence argument, so this gives no extension to arbitrary moving residues.
9. Remaining uncertainty
No argument here controls the entire far-quotient contribution, or the conditioned tail with constants uniform in the earlier system. No construction overcomes the singleton capacity restrictions while producing two separated logarithmic-density subsequences.
Accordingly, none of the failed constructions should be read as an explicit counterexample, and neither (7.1), (7.2), nor the general endpoint assertion (8.1) should be used as a proved lemma. Resolving one of those gaps, or finding a substantially different construction, is still necessary to answer the supplied problem.