Math 2.0

Number theory Definition

Hardy–Littlewood circle method

Builds on Exponential sumWaring's problemVinogradov's theorem

Definition

For real α\alpha write e(α)=e2πiαe(\alpha) = e^{2\pi i \alpha}. Let 𝒮\mathcal{S} be a finite set of positive integers, and let s≥1s \ge 1 and N≥1N \ge 1 be integers. Let r(N)r(N) be the number of ss-tuples (x1,…,xs)∈𝒮s(x_1, \ldots, x_s) \in \mathcal{S}^s with x1+⋯+xs=Nx_1 + \cdots + x_s = N. Let f(α)=∑x∈𝒮e(xα)f(\alpha) = \sum_{x \in \mathcal{S}} e(x\alpha), an exponential sum. The circle method consists of the following steps.

  1. Write r(N)=∫01f(α)s e(−Nα) dαr(N) = \int_0^1 f(\alpha)^s\, e(-N\alpha)\, d\alpha.
  2. Choose a parameter QQ and split the circle [0,1)[0, 1) into major arcs 𝔐\mathfrak{M} and minor arcs 𝔪=[0,1)∖𝔐\mathfrak{m} = [0, 1) \setminus \mathfrak{M}. The major arcs are the points near a rational a/qa/q with q≤Qq \le Q and gcd⁡(a,q)=1\gcd(a, q) = 1.
  3. On 𝔐\mathfrak{M}, approximate ff by explicit functions to get a main term, usually the product of a singular series and a singular integral.
  4. On 𝔪\mathfrak{m}, bound ∣f∣\abs{f} uniformly, for example by Weyl's inequality or Vinogradov's estimates, to show that ∫𝔪\int_{\mathfrak{m}} is smaller than the main term.

Remarks

Step 1 holds because ∫01e(mα) dα\int_0^1 e(m\alpha)\, d\alpha equals 11 for m=0m = 0 and 00 for every other integer mm; expanding f(α)sf(\alpha)^s gives one term e((x1+⋯+xs−N)α)e((x_1 + \cdots + x_s - N)\alpha) for each tuple. Example: for 𝒮={1,2}\mathcal{S} = \set{1, 2}, s=2s = 2 and N=3N = 3, f(α)2e(−3α)=e(−α)+2+e(α)f(\alpha)^2 e(-3\alpha) = e(-\alpha) + 2 + e(\alpha), whose integral is 22, matching the tuples (1,2)(1, 2) and (2,1)(2, 1). Non-example: the interval of integration must be a full period; ∫01/2e(α) dα=i/π≠0\int_0^{1/2} e(\alpha)\, d\alpha = i/\pi \ne 0, so integrating over [0,1/2)[0, 1/2) does not isolate the solutions. For Waring's problem, 𝒮\mathcal{S} is the set of kk-th powers up to NN; for Vinogradov's theorem, one uses primes weighted by log⁡p\log p. Hardy and Ramanujan worked with power series ∑anzn\sum a_n z^n and integrals over a circle ∣z∣=ρ<1\abs{z} = \rho < 1, which is the origin of the name.

Reading path

To understand this page from the ground up, read these 28 pages in order. The foundations come first.

Show the path as a graph
Algebraic number field, concept, no evidence levelAlgebraic number fieldconceptBig O notation, concept, no evidence levelBig O notationconceptBrun sieve, concept, no evidence levelBrun sieveconceptChebyshev functions, concept, no evidence levelChebyshev functionsconceptDedekind zeta function, concept, no evidence levelDedekind zeta functionconceptDirichlet L-function, concept, no evidence levelDirichlet L-functionconceptDirichlet character, concept, no evidence levelDirichlet characterconceptDivisibility, definition, no evidence levelDivisibilitydefinitionEuler's totient function, concept, no evidence levelEuler's totient funct…conceptExponential sum, concept, no evidence levelExponential sumconceptHardy–Littlewood circle method, concept, no evidence levelHardy–Littlewood circ…conceptIntegers, object, no evidence levelIntegersobjectLarge sieve, concept, no evidence levelLarge sieveconceptNumber of prime factors counted with multiplicity, concept, no evidence levelNumber of prime facto…conceptPrime number, concept, no evidence levelPrime numberconceptSiegel zero, concept, no evidence levelSiegel zeroconceptZero of a holomorphic function, concept, no evidence levelZero of a holomorphic…conceptvon Mangoldt function, concept, no evidence levelvon Mangoldt functionconceptPrime number, definition, no evidence levelPrime numberdefinitionGeneralized Riemann hypothesis, conjecture, no evidence levelGeneralized Riemann h…conjectureWaring's problem, problem, no evidence levelWaring's problemproblemPrime-counting function, definition, no evidence levelPrime-counting functi…definitionPrime number theorem, statement, no evidence levelPrime number theoremstatementSiegel–Walfisz theorem, statement, no evidence levelSiegel–Walfisz theoremstatementBombieri–Vinogradov theorem, statement, no evidence levelBombieri–Vinogradov t…statementChen's theorem, statement, no evidence levelChen's theoremstatementVinogradov's theorem, statement, no evidence levelVinogradov's theoremstatementHardy–Littlewood circle method, definition, no evidence levelHardy–Littlewood circ…definition
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Algebraic number field concept
  2. Big O notation concept
  3. Brun sieve concept
  4. Chebyshev functions concept
  5. Dedekind zeta function concept
  6. Dirichlet L-function concept
  7. Dirichlet character concept
  8. Divisibility definition
  9. Euler's totient function concept
  10. Exponential sum concept
  11. Hardy–Littlewood circle method concept
  12. Integers object
  13. Large sieve concept
  14. Number of prime factors counted with multiplicity concept
  15. Prime number concept
  16. Siegel zero concept
  17. Zero of a holomorphic function concept
  18. von Mangoldt function concept
  19. Prime number definition
  20. Generalized Riemann hypothesis conjecture
  21. Waring's problem problem
  22. Prime-counting function definition
  23. Prime number theorem statement
  24. Siegel–Walfisz theorem statement
  25. Bombieri–Vinogradov theorem statement
  26. Chen's theorem statement
  27. Vinogradov's theorem statement
  28. Hardy–Littlewood circle method definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Hardy–Ramanujan–Littlewood_circle_method
About this page
TagRGT9HH7SQQ
URIm2://RGT9HH7SQQ
Kinddefinition
WritingW0 stub
MSC11P55, 11P05
DefinesHardy–Littlewood circle method
UsesExponential sum, Waring's problem, Vinogradov's theorem
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

No page links to this page yet.