English

The Piatetski-Shapiro prime number theorem

Number Theory 2025-12-09 v2

Abstract

The Piatetski-Shapiro sequences are of the form Nc:=(nc)n=1\mathcal{N}_{c} := (\lfloor n^{c} \rfloor)_{n=1}^\infty, where \lfloor \cdot \rfloor is the integer part. It is expected that there are infinitely many primes in a Piatetski-Shapiro sequence for c(1,2)c \in (1,2). In this article, we prove there are infinitely many Piatetski-Shapiro prime numbers for 1<c<1.16121 < c < 1.1612\dots with an asymptotic formula. As a key idea, we prove a new bound for related type II sum.

Keywords

Cite

@article{arxiv.2505.10391,
  title  = {The Piatetski-Shapiro prime number theorem},
  author = {Lingyu Guo and Victor Zhenyu guo and Li Lu},
  journal= {arXiv preprint arXiv:2505.10391},
  year   = {2025}
}