Publication

A quantitative bound on Furstenberg–Sárközy patterns with shifted prime power common differences in primes

Mengdi Wang
2024

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 (Formula presented.)

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.