Wiki
Wiki

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

Updated


Statement

Theorem (p. 304, unnumbered). Let ε>0\varepsilon>0 be fixed, and put

η(x)=3−(1+ε)2log⁡log⁡x⋅log⁡log⁡log⁡log⁡x,θ(x,d)=η(x)(log⁡d)1−log⁡3.\eta(x)=3^{-(1+\varepsilon)\sqrt{2\log\log x\cdot\log\log\log\log x}}, \qquad \theta(x,d)=\eta(x)(\log d)^{1-\log 3}.

Then the number of integers n<xn<x that have divisors d,d′d,d' with

d<d′<d(1+θ(x,d))d<d'<d\bigl(1+\theta(x,d)\bigr)

is o(x)o(x). In the alternative form printed with it, the integers nn that have divisors d,d′d,d' with d<d′<d(1+θ(n,d))d<d'<d\bigl(1+\theta(n,d)\bigr) form a sequence of asymptotic density 00.

The paper adopts on p. 305, for the whole paper, the convention that log⁡x\log x is read as 11 for x≤ex\le e.

Remarks (p. 304).

  • (i) The two forms are equivalent because η(n)\eta(n) decreases slowly.
  • (ii) If only divisors d>xδd>x^\delta (or d>nδd>n^\delta) are counted, for any fixed δ>0\delta>0, the factor log⁡log⁡log⁡log⁡x\sqrt{\log\log\log\log x} in the definition of η(x)\eta(x) may be replaced by any function of xx tending to infinity. The proof makes this explicit (p. 306).
  • (iii) The theorem fails if θ(x,d)\theta(x,d) is any function of dd alone, unless trivially θ(x,d)≤1/d\theta(x,d)\le1/d, because the multiples of d(d+1)d(d+1) have positive density. The authors add that it is not clear that their η(x)\eta(x) is the most slowly decreasing function of xx that works.

Context (p. 304). The introduction recalls that Erdős (J. London Math. Soc. 39 (1964), 692--696) stated without proof that for fixed β>log⁡3−1\beta>\log 3-1 the integers nn with divisors d<d′<d(1+(log⁡n)−β)d<d'<d\bigl(1+(\log n)^{-\beta}\bigr) have asymptotic density 00, and that for β<log⁡3−1\beta<\log 3-1 this density is 11; the paper records that the second claim "has had to be withdrawn". It presents the Theorem as more precise than the first statement, particularly for small dd (essentially those with log⁡d=o(log⁡n)\log d=o(\log n)).

Proof pointer

Pp. 304--307. A pair of divisors as in the Theorem can be replaced by a coprime pair, since θ\theta decreases in dd (p. 304). Divisors d>xδd>x^\delta are handled first (pp. 305--306) by bounding a sum of yΩ(n)y^{\Omega(n)} over n<xn<x and over such pairs with dd′∣ndd'\mid n, using the mean-value formula for yΩ(m)y^{\Omega(m)} that the paper calls well known (proved by contour integration), taking y=1/3y=1/3, and restricting to the integers with Ω(n)\Omega(n) near log⁡log⁡x\log\log x (Hardy--Ramanujan). The general case (pp. 306--307) weights by zΩ(n,d)(log⁡d)log⁡3z^{\Omega(n,d)}(\log d)^{\log 3}, where Ω(n,d)\Omega(n,d) counts the prime factors of nn not exceeding dd, uses Hall's upper bound for sums of multiplicative functions with values in [0,1][0,1], takes z=1/3z=1/3, and discards the exceptional integers by the paper's Lemma (p. 307), an application of Theorem VI of Erdős, Ann. Math. 47 (1946): for fixed λ>0\lambda>0, let N(x,ξ)N(x,\xi) count the n<xn<x having some dd with ξ≤d≤n\xi\le d\le n and ∣Ω(n,d)−log⁡log⁡d∣>(1+λ)2log⁡log⁡d⋅log⁡log⁡log⁡log⁡d\lvert\Omega(n,d)-\log\log d\rvert>(1+\lambda)\sqrt{2\log\log d\cdot\log\log\log\log d}; then lim⁡ξ→∞lim sup⁡x→∞x−1N(x,ξ)=0\lim_{\xi\to\infty}\limsup_{x\to\infty}x^{-1}N(x,\xi)=0. The Lemma is applied with λ=ε/2\lambda=\varepsilon/2.

Read depth

Claims checked: the Theorem, its alternative form, the three remarks, the Lemma and the introduction were read clause by clause on the page images of the print, and the proof was followed at the level of the pointer above. The cited inputs (the mean-value formula, Hall's bound, Theorem VI of the 1946 paper) were not read. Nothing here is independently reviewed.

Dependencies

None in the corpus. External inputs named by the paper: the Hardy--Ramanujan theorem on the normal order of Ω(n)\Omega(n), R. R. Hall, Acta Arith. 25 (1974), 347--351, and P. Erdős, On the distribution function of additive functions, Ann. Math. 47 (1946), 1--20.

Source. P. Erdős and R. R. Hall, The propinquity of divisors, Bull. London Math. Soc. 11 (1979), no. 3, 304--307; the edition read is named on the source card.

Bears on

  • Problem 144: the problem asks that almost all integers have divisors d1<d2<2d1d_1<d_2<2d_1. The Theorem is a density-zero result for divisors far closer together and proves nothing toward that statement. The paper's introduction (p. 304) records that Erdős's 1964 claim of density 11 for divisors d<d′<d(1+(log⁡n)−β)d<d'<d\bigl(1+(\log n)^{-\beta}\bigr) with β<log⁡3−1\beta<\log 3-1 has been withdrawn.