2000 character limit reached
A generalization of the Barban-Davenport-Halberstam Theorem to number fields
Published 15 Oct 2012 in math.NT | (1210.3862v1)
Abstract: For a fixed number field $K$, we consider the mean square error in estimating the number of primes with norm congruent to $a$ modulo $q$ by the Chebotar\"ev Density Theorem when averaging over all $q\le Q$ and all appropriate $a$. Using a large sieve inequality, we obtain an upper bound similar to the Barban-Davenport-Halberstam Theorem.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.