Generalising the Hardy-Littlewood Method for Primes

Details Generalising the Hardy-Littlewood Method for Primes Generalising the Hardy-Littlewood Method for Primes

2006-01-10

arxiv.org/abs/math/0601211v1

Mathematics

Number Theory

26 pages, submitted to Proceedings of ICM 2006

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Generalising the Hardy-Littlewood Method for Primes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generalising the Hardy-Littlewood Method for Primes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalising the Hardy-Littlewood Method for Primes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-214503