MathLabs

Waring's problem

Solved, 1909Arithmetic and number theory
Statement

For every integer exponent k≥1k \ge 1, there exists a finite number g(k)g(k) such that every positive integer n≥1n \ge 1 can be expressed as the sum of at most s≤g(k)s \le g(k) non-negative kk-th powers, n=x1k+x2k+⋯+xskn = x_1^k + x_2^k + \dots + x_s^k.

Originally posed by Edward Waring in 1770, the qualitative existence of g(k)g(k) for every kk (the Hilbert–Waring theorem) was proved by David Hilbert in 1909 using polynomial identities derived from 2525-fold integrals over the unit sphere. In the 1920s, G. H. Hardy and J. E. Littlewood developed the analytic circle method to give quantitative bounds and study G(k)G(k)—the number of kk-th powers needed for all sufficiently large integers—later refined by I. M. Vinogradov, Hua Luogeng, and Trevor Wooley.

  1. Hilbert's existence proof for Waring's problem (1909)David Hilbert, 1909Difficulty 4/5AdvancedCondensed summary

References

  1. David Hilbert (1909). Beweis für die Darstellbarkeit der ganzen Zahlen durch eine feste Anzahl n-ter Potenzen (Waringsches Problem) · DOI:10.1007/BF01450405
  2. R. C. Vaughan, Trevor D. Wooley (2002). Waring's problem: a survey