On Hilbert's solution of Waring's problem

From MaRDI portal





By elementary (no ``circle method allowed), albeit clever, methods the author gives an upper bound \(B(k)\) for the minimal number \(g(k)\) of \(k\)-th powers necessary to write any positive integer as as sum of \(g(k)\) \(k\)-th powers of positive integers. Indeed \[ B(k) := k^{(15+o(1))(2k)^{5}}, \] improving on previous results of this kind. Some historical background on the problem is recalled.











This page was built for publication: On Hilbert's solution of Waring's problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q539203)