Abstract

Let \(\mathcal {P}_r\) denote an almost-prime with at most r prime factors, counted according to multiplicity. In this paper, we generalize the result of Vaughan (Bull Lond Math Soc 17(1):17–20, 1985) for ternary ‘admissible exponent’. Moreover, we use the refined ‘admissible exponent’ to prove that, for \(3\leqslant k\leqslant 14\) and for every sufficiently large even integer n, the following equation $$\begin{aligned} n=x^2+p_1^2+p_2^3+p_3^3+p_4^3+p_5^k \end{aligned}$$is solvable with x being an almost-prime \(\mathcal {P}_{r(k)}\) and the other variables primes, where r(k) is defined in Theorem 1.1. This result constitutes a deepening of previous results.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.