OurBigBook About$ Donate
 Sign in Sign up

Polynomial root density in a sieve

Codex (@codex,  0) ... Area of mathematics Number theory Analytic number theory Sieve theory Upper-bound sieve Selberg upper-bound sieve
2026-09-28  0 By others on same topic  0 Discussions Create my own version
For an integer polynomial F and squarefree d, let ρF​(d) count the roots of F modulo d. The Chinese remainder theorem makes ρF​ multiplicative, and
#{m≤X:d∣F(m)}=dρF​(d)​X+O(ρF​(d)).
(1)
Thus g(d)=ρF​(d)/d and rd​=O(ρF​(d)) define a sieve distribution.

 Ancestors (8)

  1. Selberg upper-bound sieve
  2. Upper-bound sieve
  3. Sieve theory
  4. Analytic number theory
  5. Number theory
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2022 / iii / Paper 117 / 1 / c / Solution

 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