Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting as in Theorem 1: are the integers not exceeding that are prime to .
Theorem 2 (p. 49). For ,
as through a sequence of values for which . By note (iv) of Section 2 (p. 40), the here need not be uniform in .
The theorem is stated without proof. The paper says (pp. 39, 49) that it can be deduced from Theorem 1 by the methods of part I, C. Hooley, On the difference of consecutive numbers prime to , Acta Arith. 8 (1963), 295--299, where the bound (A) of p. 39, , was shown for ; a footnote on p. 39 adds that (A) also holds for by Hölder's inequality. Theorem 2 replaces (A) by an asymptotic formula when .
Proof pointer
No proof is given in the paper; see the deduction it names above.
Read depth
Claims checked: the statement and the surrounding remarks on pp. 39, 40 and 49 were read on the page images of the print. No proof was checked, since the paper gives none.
Dependencies
Theorem 1 of the paper and the methods of part I (Acta Arith. 8 (1963), 295--299), which the corpus does not hold.
Source. C. Hooley, On the difference between consecutive numbers prime to : II, Publ. Math. Debrecen 12 (1965), 39--49, doi:10.5486/pmd.1965.12.1-4.06; the edition read is named on the source card.
Bears on
- Problem 235: context only. Theorem 2 gives the -th moments, for , of the same normalized gaps whose limiting distribution the problem asks about; it does not state that distribution, which is Theorem 1.