• Bulletin of the Korean Mathematical Society
• /
• v.55 no.6
• /
• pp.1659-1666
• /
• 2018

Let $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 equation $$N=x^2+p_1^2+p_2^3+p_3^3+p_4^4+p_5^4$$ is solvable with x being an almost-prime $P_4$ and the other variables primes. This result constitutes an improvement upon that of $L{\ddot{u}}$ [7].

• Journal of the Korean Mathematical Society
• /
• v.59 no.2
• /
• pp.407-420
• /
• 2022

It is proved that every sufficiently large even integer can be represented as a sum of two squares of primes, two cubes of primes, two fourth powers of primes and 17 powers of 2.

• Journal of the Korean Mathematical Society
• /
• v.59 no.3
• /
• pp.439-448
• /
• 2022

For a natural number n, let R(n) denote the number of representations of n as the sum of one square and five cubes of primes. In this paper, it is proved that the anticipated asymptotic formula for R(n) fails for at most $O(N^{{\frac{4}{9}+{\varepsilon}})$ positive integers not exceeding N.