scientific article; zbMATH DE number 3030622

MaRDI QIDQ5770403zbMATH OpenFDO

Authors L. Hua

Publication date 1938

zbMATH Keywords

Number theory

Review text

The author states that he can prove that Vinogradov's asymptotic formula for the number of representations of \(n\) as a sum of \(s\) \(k\)-th powers holds for \(s\ge 2^k + 1\). From this it follows that every large \(n\) is a sum of nine cubes of primes; every large \(n\equiv 17\pmod{240}\) is a sum of \(17\) fourth powers of primes. Almost all are sums of five cubes of primes. Hardy-Littlewood's asymptotic formula for the representations of \(n\) as a sum of \(s\) values of a polynomial \(P(x)\) of degree \(k\) for integers \(x\ge 0\), is said to hold for \(s\ge 2^k + 1\). Unless \(P(x) - P(0)\) represents only multiples of some integer \(>1\), it would follow that \( G(P(x)) \le 17\) if \(k=4\) (cf. \textit{I. M. Vinogradov}, Trav. Inst. Math. Tbilissi 3, 1--33, 35--67 (1938; Zbl 0018.05202)]; and \(G(P(x))\le 31\) if \(k=5\), with equality in a special case.

Recommendations

• On a Waring-Goldbach-type problem for fourth powers
• The asymptotic formula in Waring's problem
• Waring's problem for cubes and biquadrates
• scientific article; zbMATH DE number 3946252
• On Waring's problem for six cubes and higher powers

Cited in

(4)

• Waring's problem for polynomials of small degree
• On the asymptotic formula for the number of representations of numbers as the sum of a prime and a k-th power
• Waring's problem in prime numbers
• scientific article; zbMATH DE number 5032185 (Why is no real title available?)

This page was built for publication:

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