Piatetski-Shapiro Primes in short intervals
Abstract: The existence of primes in a short interval, which asks if there are prime numbers in the interval $[x, x + xθ]$, is a core problem in number theory. Guth and Maynard proved the best known result for this problem with an asymptotic formula while Baker, Harman and Pintz proved the best lower bound result. In this article, we focus on Piatetski-Shapiro primes in a short interval. The study of Piatetski-Shapiro primes of the form $\lfloor nc \rfloor$ is an approximation of the well-known conjecture that there exist infinitely many primes of the form $n2+1$. We prove the existence of such primes under restrictions on $θ$ and $c$ with an asymptotic formula and a lower bound, respectively.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.