Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


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,…p_0=2,p_1=3,\ldots be the primes in increasing order. Let δr(i)\delta_r(i) be the density of integers divisible by exactly rr distinct primes from {p0,…,pi}\{p_0,\ldots,p_i\}. Then

δ0(i)=pi−1piδ0(i−1)(i≥1),\delta_0(i)=\frac{p_i-1}{p_i}\delta_0(i-1)\qquad(i\geq1),

and, for r≥1r\geq1 and i≥1i\geq1,

δr(i)=pi−1piδr(i−1)+1piδr−1(i−1).(1)\delta_r(i)=\frac{p_i-1}{p_i}\delta_r(i-1) +\frac1{p_i}\delta_{r-1}(i-1). \tag{1}

The initial values are δ0(0)=δ1(0)=1/2\delta_0(0)=\delta_1(0)=1/2 and δr(0)=0\delta_r(0)=0 for r>1r>1.

Proof

Put

L=∏j=0i−1pj,L′=piL.L=\prod_{j=0}^{i-1}p_j,\qquad L'=p_iL.

For every residue modulo LL, the Chinese remainder theorem gives pi−1p_i-1 lifts modulo L′L' that are not divisible by pip_i 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=0r=0, only the first group is possible, which gives the displayed formula for δ0(i)\delta_0(i).

The recurrence also gives the following propagation corollary. If δr−1(i)\delta_{r-1}(i) is non-increasing from some index i0i_0 onward and δr(i′)<δr(i′−1)\delta_r(i')<\delta_r(i'-1) at an index i′>i0i'>i_0, then δr\delta_r is non-increasing from i′i' onward. First, subtracting δr(j)\delta_r(j) from (1) at index j+1j+1 gives

δr(j+1)−δr(j)=δr−1(j)−δr(j)pj+1.(2)\delta_r(j+1)-\delta_r(j) =\frac{\delta_{r-1}(j)-\delta_r(j)}{p_{j+1}}. \tag{2}

The strict descent at i′i' says, by (2), that δr(i′−1)>δr−1(i′−1)\delta_r(i'-1)>\delta_{r-1}(i'-1). Put aj=(pj−1)/pja_j=(p_j-1)/p_j and Dj=δr(j)−δr−1(j)D_j=\delta_r(j)-\delta_{r-1}(j). If j≥i′j\geq i', the monotonicity of δr−1\delta_{r-1} and the recurrence imply

Dj=ajδr(j−1)+1pjδr−1(j−1)−δr−1(j)≥aj(δr(j−1)−δr−1(j−1))=ajDj−1>0.\begin{aligned} D_j &=a_j\delta_r(j-1)+\frac1{p_j}\delta_{r-1}(j-1) -\delta_{r-1}(j)\\ &\geq a_j\bigl(\delta_r(j-1)-\delta_{r-1}(j-1)\bigr) =a_jD_{j-1}>0. \end{aligned}

Induction gives Dj>0D_j>0 for every j≥i′j\geq i', and (2) then gives δr(j+1)<δr(j)\delta_r(j+1)<\delta_r(j) throughout that tail. This proves the corollary as well as the recurrence.

Source correction. The second recurrence is printed with 1/p1/p in the source; the new prime is pip_i, so the correct coefficient is 1/pi1/p_i. The source states the corollary for i′≥i0i'\geq i_0; the step at j=i′j=i' above uses δr−1(i′)≤δr−1(i′−1)\delta_{r-1}(i')\leq\delta_{r-1}(i'-1), so the corollary is stated here for i′>i0i'>i_0, which both of its uses in Theorem 5 satisfy.