Asymptotic sieve for primes
Number Theory
2007-05-23 v1
Abstract
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 a^2+b^4 with the relevant asymptotics.
Cite
@article{arxiv.math/9811186,
title = {Asymptotic sieve for primes},
author = {John Friedlander and Henryk Iwaniec},
journal= {arXiv preprint arXiv:math/9811186},
year = {2007}
}
Comments
25 pages, published version