Editing Waring's problem (section)

==See also==
* [[Fermat polygonal number theorem]], that every positive integer is a sum of at most ''n'' of the ''n''-gonal numbers
* [[Waring–Goldbach problem]], the problem of representing numbers as sums of powers of primes
* [[Subset sum problem]], an algorithmic problem that can be used to find the shortest representation of a given number as a sum of powers
* [[Pollock's conjectures]]
* [[Sums of three cubes]], discusses what numbers are the sum of three ''not necessarily positive'' cubes
* [[Sums of four cubes problem]], discusses whether every integer is the sum of four cubes of integers