A Generalization of the Barban-davenport-halberstam Theorem to Number Fields (appeared in Journal of Number Theory )
نویسنده
چکیده
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ëv Density Theorem when averaging over all q ≤ Q and all appropriate a. Using a large sieve inequality, we obtain an upper bound similar to the Barban-Davenport-Halberstam Theorem.
منابع مشابه
A Variant of the Barban-davenport-halberstam Theorem (appeared in International Journal of Number Theory )
Let L/K be a Galois extension of number fields. The problem of counting the number of prime ideals p of K with fixed Frobenius class in Gal(L/K) and norm satisfying a congruence condition is considered. We show that the square of the error term arising from the Chebotarëv Density Theorem for this problem is small “on average.” The result may be viewed as a variation on the classical Barban-Dave...
متن کاملA Barban-davenport-halberstam Asymptotic for Number Fields (appeared in Proceedings of the American Mathematical Society )
Let K be a fixed number field, and assume that K is Galois over Q. Previously, the author showed that when estimating the number of prime ideals with norm congruent to a modulo q via the Chebotarëv Density Theorem, the mean square error in the approximation is small when averaging over all q ≤ Q and all appropriate a. In this article, we replace the upper bound by an asymptotic formula. The res...
متن کاملOn the Barban-davenport-halberstam Theorem: Iii
In the third article of this series we turn our attention to sequences of integers for which there exist generalized theorems of the Barban-Davenport-Halberstam type. As a prelude to our discussion we remark that a weakish form of the prime number theorem for arithmetic progressions is implied by the truth of the original version of the Barban-Davenport-Halberstam theorem, which was quoted with...
متن کاملAverage Twin Prime Conjecture for Elliptic Curves
Let E be an elliptic curve over Q. In 1988, N. Koblitz conjectured a precise asymptotic for the number of primes p up to x such that the order of the group of points of E over Fp is prime. This is an analogue of the Hardy–Littlewood twin prime conjecture in the case of elliptic curves. Koblitz’s Conjecture is still widely open. In this paper we prove that Koblitz’s Conjecture is true on average...
متن کاملClose to Uniform Prime Number Generation with Fewer Random Bits
Abstract. In this paper, we analyze several variants of a simple method for generating prime numbers with fewer random bits. To generate a prime p less than x, the basic idea is to fix a constant q ∝ x, pick a uniformly random a < q coprime to q, and choose p of the form a+ t · q, where only t is updated if the primality test fails. We prove that variants of this approach provide prime generati...
متن کامل