Producing Prime Numbers via Sieve Methods

DOI10.1007/978-3-540-36364-4_1MaRDI QIDQ3511713zbMATH OpenOpenAlexFDO

Authors J. B. Friedlander

Publication date 11 July 2008

Published in Lecture Notes in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-36364-4_1

zbMATH Keywords

prime numberssieve methods

Mathematics Subject Classification ID

Primes (11A41) Primes represented by polynomials; other multiplicative structures of polynomial values (11N32) Sieves (11N35)

Recommendations

• Using a parity-sensitive sieve to count prime values of a polynomial
• Prime-detecting sieves
• scientific article; zbMATH DE number 1296381
• Asymptotic sieve for primes
• Prime values of \(a^2 + p^4\)

Cited in

(7)

• Fermat's two-squares theorem -- a study for heuristics of proving
• Prime values of a sparse polynomial sequence
• A note on primes of the form p=aq²+1
• Gaussian primes
• On the Greatest Prime Divisor of the Sum of Two Squares of Primes
• Quantitative ergodic theorems and their number-theoretic applications
• scientific article; zbMATH DE number 3342913 (Why is no real title available?)

This page was built for publication: Producing Prime Numbers via Sieve Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511713)