The Piatetski-Shapiro prime number theorem

Abstract

The Piatetski-Shapiro sequences are of the form Nc := ( nc )n=1∞, where · is the integer part. It is expected that there are infinitely many primes in a Piatetski-Shapiro sequence for c ∈ (1,2). In this article, we prove there are infinitely many Piatetski-Shapiro prime numbers for 1 < c < 1.1612… with an asymptotic formula. As a key idea, we prove a new bound for related type I sum.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…