Sum Zero (\mod n), Size n Subsets of Integers
From MaRDI portal
Publication:3829626
The following beautiful theorem is proved: Let n be any positive integer and suppose \(a_ 1,...,a_{2n-1}\) are arbitrary integers. Then there is a subset I of 1,2,...,2n-1 such that \(\sum_{i\in I}a_ i\equiv 0 (mod n)\) and \(| I| =n\).
Recommendations
Cited in
(10)- An addition theorem on the integers modulo n
- The number of k-sums modulo k
- When are subset sums equidistributed modulo \(m\)?
- scientific article; zbMATH DE number 4204430 (Why is no real title available?)
- Balanced subset sums in dense sets of integers
- Conditions for a Zero Sum Modulo n
- The number of zero sums modulo m in a sequence of length n
- The Representation of Some Integers as a Subset Sum
- An extension of a formula of Jovovic
- Sum sequences modulo \(n\)
This page was built for publication: Sum Zero (\mod n), Size n Subsets of Integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3829626)