On the Waring-Goldbach problem for squares, cubes and higher powers

From MaRDI portal
Publication:2054723



Abstract: Let mathcalPr denote an almost-prime with at most r prime factors, counted according to multiplicity. In this paper, we generalize the result of Vaughan for ternary admissible exponent. Moreover, we use the refined admissible exponent to prove that, for 3leqslantkleqslant14 and for every sufficiently large even integer n, the following equation �egin{equation*} n=x^2+p_1^2+p_2^3+p_3^3+p_4^3+p_5^k end{equation*} is solvable with x being an almost-prime mathcalPr(k) and the other variables primes, where r(k) is defined in Theorem. This result constitutes a deepening upon that of previous results.


Let \(k\) be an integer between \(3\) and \(14\). The paper proves that any sufficiently large integer \(n\) can be written as a sum of one square, four cubes of prime numbers, and a \(k\)-th power of a prime number, provided that (a) the square has a most \(r(k)\) prime factors counted according to multiplicity, (b) the map \(r\) is defined on these \(k\)'s by the following rule: \(r(k) = k\) if \(k \in \{3,4,5\}\), \(r(k) = k-1\) if \(k \in \{6,7,8,14\}\), and \(r(k)=k-2\) in the remaining \(k\)'s.



Cites work









This page was built for publication: On the Waring-Goldbach problem for squares, cubes and higher powers

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