On the Brun-Titchmarsh theorem
The Brun–Titchmarsh theorem shows that the number of primes which are less than x and congruent to a modulo q is less than (C+o(1))x/(ϕ(q)logx) for some value C depending on logx/logq. Different authors have provided different estimates for C in different ranges for logx/logq, all of which give C&am...
| Váldodahkki: | |
|---|---|
| Materiálatiipa: | Journal article |
| Almmustuhtton: |
Polskiej Akademii Nauk, Instytut Matematyczny
2013
|