PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
Erdős-Ginzburg-Ziv theorem (Theorem)

If $ a_1, a_2,\dotsc, a_{2n-1}$ is a set of integers, then there exists a subset $ a_{i_1}, a_{i_2},\dotsc,a_{i_n}$ of $ n$ integers such that

$\displaystyle a_{i_1}+ a_{i_2}+\dotsb+a_{i_n}\equiv 0 \pmod n.$    

The theorem is also known as the EGZ theorem.

References

1
Melvyn B. Nathanson.
Additive Number Theory: Inverse Problems and Geometry of Sumsets, volume 165 of GTM.
Springer, 1996.
Zbl 0859.11003.
2

Hao,P. On a Congruence modulo a Prime
Amer. Math. Monthly, vol. 113, (2006), 652-654



"Erdős-Ginzburg-Ziv theorem" is owned by bbukh. [ full author list (2) ]
(view preamble)

View style:

Other names:  EGZ theorem
Keywords:  zero-sum
Log in to rate this entry.
(view current ratings)

Cross-references: subset, integers

This is version 4 of Erdős-Ginzburg-Ziv theorem, born on 2003-06-07, modified 2006-08-07.
Object id is 4327, canonical name is ErdHosGinzburgZivTheorem.
Accessed 3156 times total.

Classification:
AMS MSC11B50 (Number theory :: Sequences and sets :: Sequences )
 20D60 (Group theory and generalizations :: Abstract finite groups :: Arithmetic and combinatorial problems)

Pending Errata and Addenda
None.
[ View all 1 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)