Greatest of the Least Primes in Arithmetic Progressions Having a Given Modulus

DOI10.2307/2006082zbMath0407.10034OpenAlexW4252488706MaRDI QIDQ4193559

Samuel S. jun. Wagstaff

Publication date: 1979

Full work available at URL: https://doi.org/10.2307/2006082

zbMATH Keywords

Least Prime in Arithmetic Progression

Mathematics Subject Classification ID

Primes in congruence classes (11N13)

Related Items

Sieve algorithms for perfect power testing, A note on the least prime in an arithmetic progression, Faster \(p\)-adic feasibility for certain multivariate sparse polynomials, On the iteration of certain quadratic maps over GF(\(p\))., Practic zero-knowledge proofs: Giving hints and using deficiencies, Statistical Evidence for Small Generating Sets, An interactive identification scheme based on discrete logarithms and factoring, Automaticity. IV: Sequences, sets, and diversity, Short effective intervals containing primes in arithmetic progressions and the seven cubes problem, Faster integer multiplication using plain vanilla FFT primes, Explicit bounds for primes in residue classes, On the regularity of primes in arithmetic progressions

Cites Work

• Unnamed Item
• Unnamed Item
• 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