Waring's problem for sums of fourth powers of positive integers: g(1,4)=21
Waring's problem for sums of fourth powers of positive integers: \(g(1,4)=21\)
The author's main result is a recurrence estimate for the function \(G (m,r)\) by the function \(g(m - 1,r)\), both of which occur in the generalized Waring problem (with the summands to be \(\geq m)\). A consequence of this is that \(g(1,4) = 21\), that is, that any natural number, except for a finite number which can be computed explicitly, can be represented by a sum of 21 fourth powers of positive integers. The author and Vladimir Voevodskij spent a month of computer time to find that the number 77900162 can be simultaneously represented as a sum of \(2,3,4, \dots, 20\) and 21 fourth powers of positive integers. There are also analogous results for sums of squares and cubes.
- Generalization of the Hilbert-Waring theorem
- scientific article; zbMATH DE number 50239 (Why is no real title available?)
- scientific article; zbMATH DE number 3794172 (Why is no real title available?)
- Waring's problem from the standpoint of the cognitive interactive computer graphics
- Waring's problem: \(g(1,4)=21\) for fourth powers of positive integers
- Waring's problem: \(g(1,4)=21\) for fourth powers of positive integers
- scientific article; zbMATH DE number 3955035 (Why is no real title available?)
- scientific article; zbMATH DE number 3975034 (Why is no real title available?)
- On Waring's problem for squares
- scientific article; zbMATH DE number 3765904 (Why is no real title available?)
- On Sums of Sixteen Biquadrates
- Computers as a novel mathematical reality. II: Waring's problem
This page was built for publication: Waring's problem for sums of fourth powers of positive integers: \(g(1,4)=21\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1896936)
