A quantitative bound on Furstenberg-S\'ark\"ozy patterns with shifted prime power common differences in primes
Abstract
Let k≥1 be a fixed integer, and PN be the set of primes no more than N. We prove that if a set A⊂ PN contains no patterns p1,p1+(p2-1)k, where p1,p2 are prime numbers, then \[ | A|| PN|( N)-14k3+23k2. \]
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.