Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with nt.number-theory
Search options not deleted
user 27637
Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions
7
votes
Accepted
Speed of convergence for Weyl's Equidistribution theorem
As a complement to Gerry Myerson answer, you can bound the discrepancy $D_N$ using the Erdos-Turan inequality
$$
D_{N} \leq \frac{\log 2}{\pi (H + 1)} + \frac{1}{\pi N} \sum_{h = 1}^{H} \frac{1}{h}
\b …
- 166
5
votes
Speed of convergence for Weyl's Equidistribution theorem
As you see from the above two answers the rate of convergence will depend on the diophantine nature of $\alpha$. Indeed
$$
\sum_{n = 1}^{N} \exp(2\pi i h \alpha n)\ll \min(N,1/||h \alpha||)
$$
where $ …
- 166