Open Access
On the Waring–Goldbach problem for two squares and four cubes
Author(s) -
Min Zhang,
Fei Xue,
Jinjiang Li
Publication year - 2022
Publication title -
aims mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.329
H-Index - 15
ISSN - 2473-6988
DOI - 10.3934/math.2022689
Subject(s) - mathematics , combinatorics , multiplicity (mathematics) , prime (order theory) , goldbach's conjecture , integer (computer science) , prime number , arithmetic , geometry , computer science , programming language
Let $ \mathcal{P}_r $ 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 following equation \begin{document}$ \begin{equation*} N = p_1^2+p_2^2+x^3+p_3^3+p_4^3+p_5^3 \end{equation*} $\end{document} is solvable with $ x $ being an almost–prime $ \mathcal{P}_7 $ and the other variables primes. This result constitutes a deepening upon that of previous results.