Math 2.0

Number theory Additive number theory and partitions Concept

Hardy–Littlewood circle method

Summary

The circle method is an analytic technique for counting the solutions of additive equations. Examples are writing NN as a sum of ss kk-th powers, or as a sum of three primes. It writes the number of solutions as an integral over the unit circle of a power of an exponential sum. The integral is split into major arcs near rationals with small denominators, which give the main term. The rest, the minor arcs, are shown to contribute less. It goes back to Hardy and Ramanujan's work on the partition function and was developed by Hardy and Littlewood for Waring's problem.

Where this leads

3 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Hardy–Ramanujan–Littlewood_circle_method
About this page
TagZQFBEX62D0
URIm2://ZQFBEX62D0
Kindconcept
WritingW0 stub
MSC11P55, 11P05, 11P32
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by

Definitions