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\).











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)