Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Waring's problem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Mathematical problem in number theory}} In [[number theory]], '''Waring's problem''' asks whether each [[natural number]] ''k'' has an associated [[positive integer]] ''s'' such that every natural number is the sum of at most ''s'' natural numbers raised to the power ''k''. For example, every natural number is the sum of at most 4 squares, 9 cubes, or 19 fourth powers. Waring's problem was proposed in 1770 by [[Edward Waring]], after whom it is named. Its affirmative answer, known as the '''Hilbert–Waring theorem''', was provided by [[David Hilbert|Hilbert]] in 1909.<ref>{{cite journal| first = David | last = Hilbert | author-link = David Hilbert | title=Beweis für die Darstellbarkeit der ganzen Zahlen durch eine feste Anzahl n-ter Potenzen (Waringsches Problem) |language=de |journal=[[Mathematische Annalen]] |volume=67 | pages=281–300 |year=1909 | issue=3 | doi=10.1007/bf01450405 | mr=1511530| s2cid = 179177986 | url = https://zenodo.org/record/1428266 }}</ref> Waring's problem has its own [[Mathematics Subject Classification]], 11P05, "Waring's problem and variants".
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)