## You are here

HomeErd\H{o}s-Ginzburg-Ziv theorem

## Primary tabs

# Erdős-Ginzburg-Ziv theorem

If $a_{1},a_{2},\ldots,a_{{2n-1}}$ is a set of integers, then there exists a subset $a_{{i_{1}}},a_{{i_{2}}},\ldots,a_{{i_{n}}}$ of $n$ integers such that

$a_{{i_{1}}}+a_{{i_{2}}}+\cdots+a_{{i_{n}}}\equiv 0\;\;(\mathop{{\rm mod}}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

Keywords:

zero-sum

Synonym:

EGZ theorem

Type of Math Object:

Theorem

Major Section:

Reference

## Mathematics Subject Classification

20D60*no label found*11B50

*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

Sep 17

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella