OurBigBook About$ Donate
 Sign in Sign up

Iterated sumset (mA)

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Additive combinatorics Sumset
2026-10-03  0 By others on same topic  0 Discussions Create my own version
For a nonnegative integer m, the iterated sumset mA is the sum of m copies of A, with 0A={0}. Repetitions are allowed, so its elements are sums a1​+⋯+am​ with each ai​∈A.

 Ancestors (6)

  1. Sumset
  2. Additive combinatorics
  3. Combinatorics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 149 / 1 / a / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook