The Ramanujan Journal

, Volume 13, Issue 1–3, pp 333–337

On Kemnitz’ conjecture concerning lattice-points in the plane



In 1961, Erdős, Ginzburg and Ziv proved a remarkable theorem stating that each set of 2n−1 integers contains a subset of size n, the sum of whose elements is divisible by n. We will prove a similar result for pairs of integers, i.e. planar lattice-points, usually referred to as Kemnitz’ conjecture.


Zero-sum-subsets Kemnitz’ Conjecture 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  1. 1.Oxford UniversityUK

Personalised recommendations