Sum Zero (\mod n), Size n Subsets of Integers (Q3829626)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4105074
Language Label Description Also known as
default for all languages
No label defined
    English
    Sum Zero (\mod n), Size n Subsets of Integers
    scientific article; zbMATH DE number 4105074

      Statements

      Sum Zero (\mod n), Size n Subsets of Integers (English)
      0 references
      0 references
      0 references
      1989
      0 references
      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\).
      0 references

      Identifiers