Abstract
Waring’s problem for exponent k is to prove that the set of nonnegative integers is a basis of finite order, that is, to prove that every nonnegative integer can be written as the sum of a bounded number of kth powers. We denote by g(k) the smallest number s such that every nonnegative integer is the sum of exactly s kth powers of nonnegative integers. Waring’s problem is to show that g(k) is finite; Hilbert proved this in 1909. The goal of this chapter is to prove the Hilbert-Waring theorem: the kth powers are a basis of finite order for every positive integer k.
Nous ne devons pas douter que ces considérations, qui permettent ainsi d’obtenir des relations arithmétiques en les faisant sortir d’identités où figurent des intégrales définies, ne puissent un jour, quand on en aura bien compris de sens, être appliquées à des problèmes bien plus étendus que celui de Waring. 1 H. Poincaré [96]
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media New York
About this chapter
Cite this chapter
Nathanson, M.B. (1996). The Hilbert-Waring theorem. In: Additive Number Theory. Graduate Texts in Mathematics, vol 164. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3845-2_3
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3845-2_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2848-1
Online ISBN: 978-1-4757-3845-2
eBook Packages: Springer Book Archive