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 as a sum of -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
About this page
| Tag | ZQFBEX62D0 |
|---|---|
| URI | m2://ZQFBEX62D0 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 11P55, 11P05, 11P32 |
| Same as | |
| Changed | 2 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.