The Piatetski-Shapiro prime number theorem (2505.10391v1)

Abstract: The Piatetski-Shapiro sequences are of the form $\mathcal{N}{c} := (\lfloor n^{c} \rfloor){n=1}^\infty$, where $\lfloor \cdot \rfloor$ is the integer part. Piatetski-Shapiro proved there are infinitely many primes in a Piatetski-Shapiro sequence for $1 < c < 12/11 = 1.0909\dots$ in 1953 and the best admissible range of $c$ for this result is by Rivat and Wu for $1 < c < 243/205 = 1.1853\dots$ in 2001. In this article, we prove there are infinitely many Piatetski-Shapiro prime numbers for $1 < c < 6/5 = 1.2$ with an asymptotic formula. Moreover, we also prove an asymptotic formula for Piatetski-Shapiro primes in arithmetic progressions with $1 < c < 6/5 = 1.2$.