Popular differences in primes along fractional powers
Abstract
We prove that Em ≤ M En ≤ N (n) (n + mc ) = 1 + O(2 - Bc N), where c > 2 is a non-integer, B ≥ 3/c, and M is of order N1/c -B N. As a combinatorial consequence, we obtain that the primes contain infinitely many pairs whose difference belongs to the Piatetski-Shapiro sequence \ mc m ∈ N \ for any non-integer c > 2.
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.