The finite products of shifted primes and Moreira's Theorem

Abstract

Let r∈N and N=i=1rCi. Do there exist x,y∈N and i∈\1,2,…,r\ such that \x,y,xy,x+y\⊂eq Ci? This is still an unanswered question asked by N. Hindman. Joel Moreira in [Annals of Mathematics 185 (2017) 1069-1090] established a partial answer to this question and proved that for infinitely many x,y∈N, \x,xy,x+y\⊂eq Ci for some i∈\1,2,…,r\, which is called Moreira's Theorem. Recently, H. Hindman and D. Strauss established a refinement of Moreira's Theorem and proved that for infinitely many y, \x∈N:\x,xy,x+y\⊂eq Ci\ is a piecewise syndetic set. In this article, we will prove infinitely many y∈ FP(P-1) such that \x∈N:\xy,x+f(y):f∈ F\⊂eq Ci\ is piecewise syndetic, where F is a finite subset of xZ[x]. We denote P is the set of prime numbers in N and FP(P-1) is the set of all finite products of distinct elements of P-1.

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…