Using a parity-sensitive sieve to count prime values of a polynomial
From MaRDI portal
Publication:4340414
DOI10.1073/pnas.94.4.1054zbMath0870.11059WikidataQ24684768 ScholiaQ24684768MaRDI QIDQ4340414
John B. Friedlander, Henryk 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
11N36: Applications of sieve methods
11N32: Primes represented by polynomials; other multiplicative structures of polynomial values
Related Items