Pólya-Vinogradov inequality
Theorem 1.
For and a positive odd rational prime,
Proof.
Start with the following manipulations:
The expression is just a Gauss sum, and has magnitude . Hence
Here denotes the absolute value of the difference between and the closest integer to , i.e. .
Since is odd, we have
Now for ; to prove this, it suffices to show that the function given by is decreasing and approaches 1 as . To prove the latter statement, substitute and take the limit as using L’Hôpital’s rule. To prove the former statement, it will suffice to show that is less than zero on the interval . But as and is increasing on , since for , so is less than zero for .
With this in hand, we have
∎
References
- 1 Vinogradov, I. M., Elements of Number Theory, 5th rev. ed., Dover, 1954.
Title | Pólya-Vinogradov inequality |
---|---|
Canonical name | PolyaVinogradovInequality |
Date of creation | 2013-03-22 12:46:23 |
Last modified on | 2013-03-22 12:46:23 |
Owner | djao (24) |
Last modified by | djao (24) |
Numerical id | 7 |
Author | djao (24) |
Entry type | Theorem |
Classification | msc 11L40 |