Let [ · ] be the fioor function. In this paper, we show that when 1 < c < 37/36, then every sufficiently large positive integer N can be represented in the form
where p1, p2, p3 are primes close to squares.
R. Baker. Some diophantine equations and inequalities with primes. Funct. Approx. Com-ment. Math., 64(2):203–250, 2021.
K. Buriev. Additive problems with prime numbers. Ph.D. Thesis, Moscow State University, 1989. (In Russian.)
Y. Cai. On a Diophantine equation involving primes. Ramanujan J., 50:151–162, 2019.
S. I. Dimitrov. A ternary diophantine inequality by primes near to squares. to appear in J. Ramanujan Math. Soc., 2022.
A. Karatsuba. Principles of the Analytic Number Theory. Nauka, Moscow, 1983. (In Russian.)
A. Kumchev and D. Tolev. An additive problem with prime numbers from a thin set. Acta Math. Hungarica, 76:31–43, 1997.
A. Kumchev and T. Nedeva. On an equation with prime numbers. Acta Arith., 83:117–126, 1998.
M. Laporta and D. Tolev. On an equation with prime numbers. Mat. Zametki, 57:926–929, 1995.
D. Tolev. On a diophantine inequality involving prime numbers. Acta Arith., 61:289–306, 1992.
W. Zhai and X. Cao. A Diophantine equation with prime numbers. Acta Math. Sinica, Chinese Series, 45:443–454, 2002.
M. Zhang and J. Li. On a Diophantine equation with three prime variables. Integers, 19:A39, 2019.