2000 character limit reached
The Green-Tao theorem for Piatetski-Shapiro primes
Published 27 Jan 2019 in math.NT and math.CO | (1901.09372v1)
Abstract: Let $m\geq 3$. Suppose that $$ 1-2{-2{m24m}}<\gamma<1. $$ Then the set $$ {p\text{ prime}:\, p=[n{\frac1\gamma}]\text{ for some }n\in{\mathbb N}} $$ contains infinitely many non-trivial $m$-term arithmetic progressions.
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.