English

Additive problems on $\lfloor p^c \rfloor$

Number Theory 2026-01-12 v2

Abstract

The sequence P(c)=(pc)pP(c>0,cN), \mathbb{P}^{(c)}=(\lfloor p^c \rfloor)_{p\in \mathbb{P}}\quad (c>0,c\notin \mathbb{N}), is an important subsequence of the well-known Piatetski-Shapiro sequence, where P\mathbb{P} is the set of prime numbers and \lfloor \cdot \rfloor is the floor function. We prove that for all c(0,13/15)c \in (0, 13/15), any large enough integer NN can be represented as N=pc+q, N=\lfloor p^c\rfloor+q, where pp and qq are primes. We also prove the result holds for almost all fixed positive cRZc \in \mathbb{R}\setminus\mathbb{Z}. Moreover, we investigate shifted primes in this sequence, obtaining an asymptotic formula for all c(0,13/15)c \in (0, 13/15) and an almost-all result for fixed positive cRZc \in \mathbb{R}\setminus\mathbb{Z}.

Keywords

Cite

@article{arxiv.2505.19833,
  title  = {Additive problems on $\lfloor p^c \rfloor$},
  author = {Lingyu Guo and Victor Zhenyu Guo and Li Lu},
  journal= {arXiv preprint arXiv:2505.19833},
  year   = {2026}
}
R2 v1 2026-07-01T02:39:10.846Z