Source. Stijn Cambie, Resolution of Erdős' problems about
unimodularity, arXiv:2501.10333v1 (17 January 2025), Claim 6 and proof,
p. 4.
Bears on. #690 and
Theorem 5.
Statement
Let p0=2,p1=3,… be the primes in increasing order. Let
δr(i) be the density of integers divisible by exactly r distinct
primes from {p0,…,pi}. Then
δ0(i)=pipi−1δ0(i−1)(i≥1),
and, for r≥1 and i≥1,
δr(i)=pipi−1δr(i−1)+pi1δr−1(i−1).(1)
The initial values are δ0(0)=δ1(0)=1/2 and
δr(0)=0 for r>1.
Proof
Put
L=j=0∏i−1pj,L′=piL.
For every residue modulo L, the Chinese remainder theorem gives pi−1
lifts modulo L′ that are not divisible by pi and one lift that is.
The first group preserves the number of distinct prime divisors from the old
set, and the second group increases it by one. Counting the two groups gives
(1). For r=0, only the first group is possible, which gives the displayed
formula for δ0(i).
The recurrence also gives the following propagation corollary. If
δr−1(i) is non-increasing from some index i0 onward and
δr(i′)<δr(i′−1) at an index i′>i0, then δr is
non-increasing from i′ onward. First, subtracting δr(j) from (1)
at index j+1 gives
δr(j+1)−δr(j)=pj+1δr−1(j)−δr(j).(2)
The strict descent at i′ says, by (2), that
δr(i′−1)>δr−1(i′−1). Put
aj=(pj−1)/pj and
Dj=δr(j)−δr−1(j). If j≥i′, the monotonicity of
δr−1 and the recurrence imply
Dj=ajδr(j−1)+pj1δr−1(j−1)−δr−1(j)≥aj(δr(j−1)−δr−1(j−1))=ajDj−1>0.
Induction gives Dj>0 for every j≥i′, and (2) then gives
δr(j+1)<δr(j) throughout that tail. This proves the
corollary as well as the recurrence.
Source correction. The second recurrence is printed with 1/p in the
source; the new prime is pi, so the correct coefficient is 1/pi. The
source states the corollary for i′≥i0; the step at j=i′ above uses
δr−1(i′)≤δr−1(i′−1), so the corollary is stated here
for i′>i0, which both of its uses in Theorem 5 satisfy.