Additive problems on ⌊pc⌋\lfloor p^c \rfloor

preprint2026arXivOpen access

Abstract

The sequence P(c)=(⌊pc⌋)p∈P(c>0,c∉N), \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 c∈R∖Zc \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 c∈R∖Zc \in \mathbb{R}\setminus\mathbb{Z}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.