Explicit bounds for primes in residue classes
Open Access
- 1 July 1996
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 65 (216) , 1717-1735
- https://doi.org/10.1090/s0025-5718-96-00763-6
Abstract
Let be an abelian extension of number fields, with . Let and denote the absolute discriminant and degree of . Let denote an element of the Galois group of . We prove the following theorems, assuming the Extended Riemann Hypothesis:Keywords
This publication has 17 references indexed in Scilit:
- Numerical Computations Concerning the ERHMathematics of Computation, 1993
- Statistical Evidence for Small Generating SetsMathematics of Computation, 1993
- Searching for Primitive Roots in Finite FieldsMathematics of Computation, 1992
- Explicit Bounds for Primality Testing and Related ProblemsMathematics of Computation, 1990
- Factoring with Cyclotomic PolynomialsMathematics of Computation, 1989
- Estimates for the Chebyshev Function ψ(x) - θ(x)Mathematics of Computation, 1985
- The Area-Time Complexity of Binary MultiplicationJournal of the ACM, 1981
- A Rapidly Convergent Series for Computing ψ(z) and Its DerivativesMathematics of Computation, 1981
- A bound for the least prime ideal in the Chebotarev Density TheoremInventiones Mathematicae, 1979
- Greatest of the Least Primes in Arithmetic Progressions Having a Given ModulusMathematics of Computation, 1979