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 be fixed, and put
Then the number of integers that have divisors with
is . In the alternative form printed with it, the integers that have divisors with form a sequence of asymptotic density .
The paper adopts on p. 305, for the whole paper, the convention that is read as for .
Remarks (p. 304).
- (i) The two forms are equivalent because decreases slowly.
- (ii) If only divisors (or ) are counted, for any fixed , the factor in the definition of may be replaced by any function of tending to infinity. The proof makes this explicit (p. 306).
- (iii) The theorem fails if is any function of alone, unless trivially , because the multiples of have positive density. The authors add that it is not clear that their is the most slowly decreasing function of 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 the integers with divisors have asymptotic density , and that for this density is ; 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 (essentially those with ).
Proof pointer
Pp. 304--307. A pair of divisors as in the Theorem can be replaced by a coprime pair, since decreases in (p. 304). Divisors are handled first (pp. 305--306) by bounding a sum of over and over such pairs with , using the mean-value formula for that the paper calls well known (proved by contour integration), taking , and restricting to the integers with near (Hardy--Ramanujan). The general case (pp. 306--307) weights by , where counts the prime factors of not exceeding , uses Hall's upper bound for sums of multiplicative functions with values in , takes , 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 , let count the having some with and ; then . The Lemma is applied with .
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 , 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 . 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 for divisors with has been withdrawn.