On a problem of Erdos and Graham about consecutive sums in strictly increasing sequences
Abstract
We show the existence of a constant c > 0 such that, for all positive integers n, there exist integers 1 ≤ a1 < … < ak ≤ n such that there are at least cn2 distinct integers of the form Σi=uvai with 1 ≤ u ≤ v ≤ k. This answers a question of Erdos and Graham. We also prove a non-trivial upper bound on the maximum number of distinct integers of this form and address several open problems.
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.