On the Waring-Goldbach problem for one square and five cubes

From MaRDI portal
Publication:4683198




Abstract: Let mathcalPr denote an almost-prime with at most r prime factors, counted according to multiplicity. In this paper, it is proved that for every sufficiently large even integer N, the equation �egin{equation*} N=x^2+p_1^3+p_2^3+p_3^3+p_4^3+p_5^3 end{equation*} is solvable with x being an almost-prime mathcalP6 and the other variables primes. This result constitutes an improvement upon that of Cai, who obtained the same conclusion, but with mathcalP36 in place of mathcalP6.









This page was built for publication: On the Waring-Goldbach problem for one square and five cubes

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