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

DOI10.1073/pnas.94.4.1054zbMath0870.11059OpenAlexW1985056301WikidataQ24684768 ScholiaQ24684768MaRDI QIDQ4340414

John B. Friedlander

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

polynomialprimesieveparityGaussian primesnumber of primes in thin sequences

Mathematics Subject Classification ID

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

Related Items (2)

Isolated elliptic curves and the MOV attack ⋮ Nombres premiers de la forme ⌊n^c⌋

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