Papers
Topics
Authors
Recent
Search
2000 character limit reached

Piatetski-Shapiro Primes in short intervals

Published 31 May 2026 in math.NT | (2606.01115v1)

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.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.