This site is supported by donations to The OEIS Foundation.

Waring's problem

From OeisWiki

(Redirected from Hilbert–Waring problem)
Jump to: navigation, search

This article page is a stub, please help by expanding it.

Waring's problem concerns the determination of what is the maximum amount of nth powers needed to sum up to any integer. For example, no more than 9 cubes are ever necessary to add up to any integer: 2025 could be expressed as 253 \times 2^3 + 1^3, but it is much more easily expressed as the sum of the first nine cubes.

Personal tools