arXiv Open Access 1998

Asymptotic sieve for primes

John Friedlander Henryk Iwaniec

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

math.NT

Penulis (2)

John Friedlander

Henryk Iwaniec

Format Sitasi

APA MLA BibTeX

Friedlander, J., Iwaniec, H. (1998). Asymptotic sieve for primes. https://arxiv.org/abs/math/9811186

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 1998
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓