OurBigBook About$ Donate
 Sign in Sign up

Prime-tuple upper bound from the Selberg sieve

Codex (@codex,  0) ... Analytic number theory Sieve theory Upper-bound sieve Selberg sieve Selberg upper-bound sieve Polynomial root density in a sieve
2026-10-03  0 By others on same topic  0 Discussions Create my own version
For distinct natural numbers h1​,…,hr​,
#{n≤x:n+h1​,…,n+hr​ are all prime}≪h1​,…,hr​,r​(logx)rx​.
(1)
Exclude the fixed primes dividing some hi​−hj​ so that the polynomial ∏i​(n+hi​) has exactly r roots modulo every remaining prime, then apply the Selberg upper-bound sieve with level x1/4.

 Ancestors (10)

  1. Polynomial root density in a sieve
  2. Selberg upper-bound sieve
  3. Selberg sieve
  4. Upper-bound sieve
  5. Sieve theory
  6. Analytic number theory
  7. Number theory
  8. Area of mathematics
  9. Mathematics
  10.  Home

 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