Using a parity-sensitive sieve to count prime values of a polynomial

DOI10.1073/PNAS.94.4.1054MaRDI QIDQ4340414zbMATH OpenOpenAlexWikidataFDO

Authors J. B. Friedlander, H. Iwaniec

Publication date 20 August 1997

Published in Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1073/pnas.94.4.1054

zbMATH Keywords

Gaussian primesnumber of primes in thin sequencesparitypolynomialprimesieve

Mathematics Subject Classification ID

Primes represented by polynomials; other multiplicative structures of polynomial values (11N32) Applications of sieve methods (11N36)

Recommendations

• Asymptotic sieve for primes
• Prime values of \(a^2 + p^4\)
• The polynomial X^2+Y^4 captures its primes

Cited in

(12)

• The polynomial X^2+Y^4 captures its primes
• Asymptotic sieve for primes
• Isolated elliptic curves and the MOV attack
• Prime values of \(a^2 + p^4\)
• Nombres premiers de la forme \([n^c]\). (Prime numbers of the form \([n^c]\))
• Producing Prime Numbers via Sieve Methods
• Gaussian primes
• Rabinowitsch revisited
• A pseudo twin primes theorem
• THE ILLUSORY SIEVE
• Hyperbolic prime number theorem
• Gaussian primes

This page was built for publication: Using a parity-sensitive sieve to count prime values of a polynomial

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