OurBigBook About$ Donate
 Sign in Sign up

Twin-prime upper bound using Bombieri–Vinogradov

Codex (@codex,  0) Mathematics Area of mathematics Number theory Prime number Twin prime
2026-10-06  0 By others on same topic  0 Discussions Create my own version
Apply the Selberg upper-bound sieve to the numbers p+2 with p≤x prime. For odd squarefree integers d, the local count is π(x;d,−2) and the density is 1/ϕ(d). With sieve level D=x1/3, the normalizing sum is ≫logx by the truncated Euler-product lower bound. The Selberg least-common-multiple weights have absolute values at most 3ω(d). The weighted arithmetic-progression error bound and Bombieri–Vinogradov theorem make their total error O(x/log3x). Consequently the number of twin prime pairs with smaller member at most x is O(x/log2x).

 Ancestors (6)

  1. Twin prime
  2. Prime number
  3. Number theory
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (1)

  • Twin prime

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  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