A variation on the Hilbert-Waring problem
The history of the Hilbert-Waring problem dates back to Diophantus of Alexandria and his famous book Arithmetica. It states that given a power k≥2, every positive integer n can be written as a sum of μk k-powers, where μk depends on k; that is, n=xk1+...+xkμk. I will discuss a short solution on a variation of this problem.