English

On an equation by primes with one Linnik prime

Number Theory 2023-12-01 v3

Abstract

Let [][\, \cdot\,] be the floor function. In this paper, we prove that when 1<c<16559152761<c<\frac{16559}{15276}, then every sufficiently large positive integer NN can be represented in the form \begin{equation*} N=[p^c_1]+[p^c_2]+[p^c_3]\,, \end{equation*} where p1,p2,p3p_1,p_2,p_3 are primes, such that p1=x2+y2+1p_1=x^2 + y^2 +1.

Keywords

Cite

@article{arxiv.2108.03525,
  title  = {On an equation by primes with one Linnik prime},
  author = {S. I. Dimitrov},
  journal= {arXiv preprint arXiv:2108.03525},
  year   = {2023}
}

Comments

arXiv admin note: substantial text overlap with arXiv:2107.04028, arXiv:2012.06476, arXiv:2011.03967

R2 v1 2026-06-24T04:54:57.533Z