Asymptotic sieve for primes
From MaRDI portal
Publication:1281443
DOI10.2307/121035zbMath0926.11067arXivmath/9811186OpenAlexW2155764708WikidataQ59445253 ScholiaQ59445253MaRDI QIDQ1281443
John B. Friedlander, Henryk Iwaniec
Publication date: 24 November 1999
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9811186
parityasymptotic sieve for primesbilinear form hypothesisbilinear hypothesisparity-sensitiveprime-counting formula
Related Items (22)
On Bombieri’s asymptotic sieve ⋮ A remark on divisor-weighted sums ⋮ On the Connection Between the Goldbach Conjecture and the Elliott-Halberstam Conjecture ⋮ A LOWER BOUND ON THE NUMBER OF PRIMES BETWEEN AND n ⋮ Twin primes and the parity problem ⋮ Fine-scale distribution of roots of quadratic congruences ⋮ Different approaches to the distribution of primes ⋮ The polynomials X2+(Y2+1)2$X^2+(Y^2+1)^2$ and X2+(Y3+Z3)2$X^{2} + (Y^3+Z^3)^2$ also capture their primes ⋮ Counting primes ⋮ The infinitude of $\mathbb {Q}(\sqrt {-p})$ with class number divisible by 16 ⋮ On prime values of binary quadratic forms with a thin variable ⋮ THE ILLUSORY SIEVE ⋮ Modular forms with large coefficient fields via congruences ⋮ Inequalities for divisor functions ⋮ Primes represented by \(x^3+ 2y^3\) ⋮ On a problem of Gelfond: the sum of digits of prime numbers ⋮ Divisor weighted sums ⋮ On Gelfond's conjecture about the sum of digits of prime numbers ⋮ Prime values of a sparse polynomial sequence ⋮ Small gaps between prime numbers: The work of Goldston-Pintz-Yildirim ⋮ A polynomial divisor problem ⋮ Prime values of \(a^2 + p^4\)
This page was built for publication: Asymptotic sieve for primes
