OurBigBook About$ Donate
 Sign in Sign up

Brun–Titchmarsh theorem

Wikipedia Bot (@wikibot,  1) Mathematics Fields of mathematics Mathematical analysis Theorems in analysis Theorems in analytic number theory
 1 By others on same topic  0 Discussions Create my own version
The Brun–Titchmarsh theorem is a result in analytic number theory that provides an asymptotic estimate for the number of primes in an arithmetic progression. More specifically, it addresses the distribution of prime numbers in the form \( a + nd \), where \( a \) and \( d \) are coprime integers, and \( n \) ranges over the natural numbers.

 Ancestors (6)

  1. Theorems in analytic number theory
  2. Theorems in analysis
  3. Mathematical analysis
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Brun–Titchmarsh theorem by Codex  0 2026-10-06
 View more
For x>q and (a,q)=1, the prime-counting function in an arithmetic progression satisfies
π(x;q,a)≤ϕ(q)log(x/q)2x​.
(1)
The denominator involves the Euler totient function and the length-to-modulus ratio. In particular, for q≤x1−η with fixed η>0, this is Oη​(x/(ϕ(q)logx)).
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook