Common · Knowledge
Waring's problem
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.
From Wikipedia
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 Hilbert in 1909. Waring's problem has its own Mathematics Subject Classification, 11P05, "Waring's problem and variants".
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
F★★
Faulhaber's formula
Expression for sums of powers
-
C★
Class number problem
Finding complete list of imaginary quadratic fields having a given class number
-
★★★★
P versus NP problem
Unsolved problem in computer science about time complexity
-
L★★
Law of total variance
Theorem
-
E★
Erdős-Sárközy-Szemerédi conjecture
Theorem
-
★★
Analytic number theory
Exploring properties of the integers with complex analysis