Asymptotic sieve for primes

@inproceedings{Friedlander1998AsymptoticSF,
  title={Asymptotic sieve for primes},
  author={John B. Friedlander and Henryk Iwaniec},
  year={1998}
}
For a long time it was believed that sieve methods might be incapable of achieving the goal for which they had been created, the detection of prime numbers. Indeed, it was shown [S], [B] to be inevitable that, in the sieve’s original framework, no such result was possible although one could come tantalizingly close. This general limitation is recognized as the “parity problem” of sieve theory. More recently, beginning with the work [IJ], this goal has in certain cases become possible by… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Bombieri’s sieve

J. Friedlander, H. Iwaniec
Analytic Number Theory, Proc. Halberstam Conf., Allerton Park Illnois, June 1995, ed. B. C. Berndt et al., pp. 411–430, Birkhäuser (Boston) • 1996

Equidistribution of roots of a quadratic congruence to prime moduli

W. Duke, J. B. Friedlander, H. Iwaniec
Ann. of Math • 1995

Sur une somme liée à la fonction de Möbius

G. Tenenbaum
Ann . of Math . • 1995

On elementary methods in primenumber-theory and their limitations

A. Selberg
Proc. 11th Scand. Math. Cong. Trondheim (1949), Collected Works Vol. I, pp. 388–397, Springer (Berlin) • 1989
View 1 Excerpt

On the distribution of αp modulo one

G. Harman
J. London Math. Soc • 1983

A new form of the error term in the linear sieve

H. Iwaniec
Acta Arith • 1980

The asymptotic sieve, Mem

E. Bombieri
Acad. Naz. dei XL, • 1976

A new proof of a theorem of van der Corput

D. Wolke
J. London Math. Soc • 1972

Similar Papers

Loading similar papers…