On the Union of Arithmetic Progressions
Abstract
We show that for every >0 there is an absolute constant c()>0 such that the following is true. The union of any n arithmetic progressions, each of length n, with pairwise distinct differences must consist of at least c()n2- elements. We observe, by construction, that one can find n arithmetic progressions, each of length n, with pairwise distinct differences such that the cardinality of their union is o(n2). We refer also to the non-symmetric case of n arithmetic progressions, each of length , for various regimes of n and .
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.