Abstract
<abstract><p>Suppose that $ N $ is a sufficiently large real number. In this paper it is proved that for $ 2 < c < \frac{990}{479} $, the Diophantine equation</p>
<p><disp-formula> <label/> <tex-math id="FE1"> \begin{document}$ \left[p_{1}^{c}\right]+\left[p_{2}^{c}\right]+\left[p_{3}^{c}\right]+\left[p_{4}^{c}\right]+\left[p_{5}^{c}\right] = N $\end{document} </tex-math></disp-formula></p>
<p>is solvable in primes $ p_{1}, p_{2}, p_{3}, p_4, p_5 $ such that each of the numbers $ p_{i}+2, i = 1, 2, 3, 4, 5 $ has at most $ \left[\frac{6227}{3960-1916c}\right] $ prime factors.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Reference27 articles.
1. K. Buriev, Additive problems with prime numbers, Ph.D. thesis, Moscow University, 1989.
2. R. Baker, Some Diophantine equations and inequalities with primes, Funct. Approx. Comment. Math., 64 (2021), 203–250. https://doi.org/10.7169/facm/1912
3. J. Brüdern, E. Fouvry, Lagrange's Four Squares Theorem with almost prime variables, J. Reine Angew. Math., 454 (1994), 59–96. https://doi.org/10.1515/crll.1994.454.59
4. J. R. Chen, On the representation of a larger even integer as the sum of a prime and the product of at most two primes, Sci. Sinica, 16 (1973), 157–176.
5. Y. C. Cai, M. G. Lu, Additive problems involving primes of special type, Acta Arith., 140 (2009), 189–204. https://doi.org/10.4064/aa140-2-6