Greatest of the Least Primes in Arithmetic Progressions Having a Given Modulus
From MaRDI portal
Publication:4193559
DOI10.2307/2006082zbMath0407.10034MaRDI QIDQ4193559
Publication date: 1979
Full work available at URL: https://doi.org/10.2307/2006082
11N13: Primes in congruence classes
Related Items
Faster integer multiplication using plain vanilla FFT primes, Explicit bounds for primes in residue classes, On the regularity of primes in arithmetic progressions, Faster \(p\)-adic feasibility for certain multivariate sparse polynomials, Automaticity. IV: Sequences, sets, and diversity, A note on the least prime in an arithmetic progression, Practic zero-knowledge proofs: Giving hints and using deficiencies, An interactive identification scheme based on discrete logarithms and factoring, On the iteration of certain quadratic maps over GF(\(p\))., Sieve algorithms for perfect power testing, Statistical Evidence for Small Generating Sets, Short effective intervals containing primes in arithmetic progressions and the seven cubes problem
Cites Work
- A note on the least prime in an arithmetic progression
- Über Primzahlen in arithmetischen Folgen
- Über die kleinste Primzahl einer arithmetischen Reihe.
- Almost-primes in arithmetic progressions and short intervals
- The Irregular Primes to 125000
- Remark on the paper of K. Prachar „Über die kleinste Primzahl einer arithmetischen Reihe“.
- Real zeros of the Dedekind zeta function of an imaginary quadratic field
- Unnamed Item
- Unnamed Item
