Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Let be a prime and, for integers ,
where and .
Equation (3) (printed p. 382). If , then for every integer ,
The article calls this the non-trivial bound found by Kloosterman and notes that it shows has some cancellation once the length of is of order larger than .
Weil's bound, display (4) (printed p. 382), cited from Weil's 1948 paper and not proved in the article: if , then . The article calls this essentially best possible.
Source. D. R. Heath-Brown, Arithmetic applications of Kloosterman sums, Nieuw Arch. Wiskd. (5) 1 (2000), no. 4, 380–384; the argument on printed pp. 381–382, displays (2), (3) and (4). The edition is identified on the source card.
Read depth. Claims checked: statement (3) and the hypotheses of (3) and (4) were read against the print, and the steps of the proof of (3) were read and found to give the stated inequality. Weil's bound is cited, not proved, in the article. Nothing here is independently reviewed.
Proof pointer
Printed pp. 381–382. For prime to the substitution gives , so, since , the fourth moment contains copies of (display (2)). Expanding the fourth power and summing over and by orthogonality gives times the number of quadruples of nonzero residues with and . Such a quadruple has or , so there are at most of them. Hence , which is (3).
Dependencies
None in the article for (3). Display (4) is Weil's theorem (the article's reference [13]).
Bears on
No Erdős problem directly. The article's origin-rectangle estimate, the result the corpus cites, uses Weil's bound (4), not (3).