Additive problems on pc

Abstract

The sequence P(c)=( pc )p∈ P (c>0,c N), is an important subsequence of the well-known Piatetski-Shapiro sequence, where P is the set of prime numbers and · is the floor function. We prove that for all c ∈ (0, 13/15), any large enough integer N can be represented as N= pc+q, where p and q are primes. We also prove the result holds for almost all fixed positive c ∈ R. Moreover, we investigate shifted primes in this sequence, obtaining an asymptotic formula for all c ∈ (0, 13/15) and an almost-all result for fixed positive c ∈ R.

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…