Generalising the Hardy-Littlewood Method for Primes
| dc.creator | Green, Ben | |
| dc.date | 2006-01-10 | |
| dc.date.accessioned | 2026-07-07T06:58:43Z | |
| dc.date.available | 2026-07-07T06:58:43Z | |
| dc.description | The Hardy-Littlewood method is a well-known technique in analytic number theory. Among its spectacular applications are Vinogradov's 1937 result that every sufficiently large odd number is a sum of three primes, and a related result of Chowla and Van der Corput giving an asymptotic for the number of 3-term progressions of primes, all less than N. This article surveys recent developments of the author and T. Tao, in which the Hardy-Littlewood method has been generalised to obtain, for example, an asymptotic for the number of 4-term arithmetic progressions of primes less than N. | |
| dc.description | 26 pages, submitted to Proceedings of ICM 2006 | |
| dc.identifier | https://arxiv.org/abs/math/0601211 | |
| dc.identifier | http://arxiv.org/abs/math/0601211 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/107467 | |
| dc.subject | Number Theory | |
| dc.title | Generalising the Hardy-Littlewood Method for Primes | |
| dc.type | text |