Asymptotic sieve for primes
| dc.creator | Friedlander, John | |
| dc.creator | Iwaniec, Henryk | |
| dc.date | 1998-11-01 | |
| dc.date.accessioned | 2026-07-07T05:27:03Z | |
| dc.date.available | 2026-07-07T05:27:03Z | |
| dc.description | 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. | |
| dc.description | 25 pages, published version | |
| dc.identifier | https://arxiv.org/abs/math/9811186 | |
| dc.identifier | http://arxiv.org/abs/math/9811186 | |
| dc.identifier | Ann. of Math. (2) 148 (1998), no. 3, 1041-1065 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/77778 | |
| dc.subject | Number Theory | |
| dc.title | Asymptotic sieve for primes | |
| dc.type | text |