1998/11/01 by John Friedlander, Henryk Iwaniec
Mathematics · #math.NT
published as Ann. of Math. (2) 148 (1998), no. 3, 1041-1065 · 25 pages, published version
arxiv created 1998/11/01 · arxiv updated 2009/11/30
This article develops a new sieve method which by adding an additional axiom to the classical formulation breaks the well-known parity problem and allows one to detect primes in thin, interesting integer sequences. In the accompanying paper [math.NT/9811184] the practicality of the axiom is demonstrated by verifying it (and the other axioms) to produce primes in the sequence a2+b4 with the relevant asymptotics.