Erdős, Ginzburg and Ziv prove the following:
Let $n \geq 1$ and $a\_1,\ldots, a\_{2n-1}\in \mathbb{Z}$. There exist distinct $i\_1,\ldots , i\_n$
such that
$$
a\_{i\_1} + \cdots + a\_{i\_n} \equiv 0 \pmod{n}.
$$
Is there a proof that doesn't use the Chevalley–Warning theorem (or a variant of its proof)?



EGZ theorem (Erdős-Ginzburg-Ziv)
The original proof used Cauchy-Davenport lemma. Several proofs are given in [this](http://www.tau.ac.il/~nogaa/PDFS/egz1.pdf) article of Alon-Dubiner (The proofs deal only with the case when $n$ is prime, but deducing the general case is straightforward from there). Note that the ideas behind most of these proofs could be interpreted as special cases of the more powerful theorem that is commonly known as "Combinatorial Nullstellensatz" (proven by N. Alon, see [here](http://www.cs.tau.ac.il/~nogaa/PDFS/null2.pdf)). The keyword for results like these is "Zero-sum Ramsey theory".


ETA: You might also find the paper by Olson, "A combinatorial problem in finite abelian groups", Journal of Number Theory (1969) Vol.1 very interesting. It proves a generalization of EGZ theorem for finite abelian p-groups (I think this was one of the first among many other generalizations).


