Sumsets Containing Powers of an Integer

Let n≥1, and let m be an integer with m≥2. We show that if a subset A of the interval [0,n] satisfies that 0∈A and |A|>1+n/2, then mA, the set of the sum of m (not necessarily distinct) elements in A, has a power of m. This result is best possible in the case that m is odd.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Tetsuya Abe.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Abe, T. Sumsets Containing Powers of an Integer. Combinatorica 24, 1–4 (2004). https://doi.org/10.1007/s00493-004-0001-3

Download citation

Mathematics Subject Classification (2000):

  • 11B13
  • 05D05