Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-28T05:04:17.901Z Has data issue: false hasContentIssue false
  • English
  • Français

The number of zero sums modulo m in a sequence of length n

Part of: Sequences and sets

Published online by Cambridge University Press:  26 February 2010

M. Kisin
M. Kisin
Affiliation:
Department of Mathematics, Fine Hall, Princeton University, Washington Road, Princeton, N.J. 08544-1000, U.S.A.
Get access

Abstract

We prove a result related to the Erdős-Ginzburg-Ziv theorem: Let p and q be primes, α a positive integer, and m∈{pα, pαq}. Then for any sequence of integers c= {c1, c2,…, cn} there are at least

subsequences of length m, whose terms add up to 0 modulo m (Theorem 8). We also show why it is unlikely that the result is true for any m not of the form pα or pαq (Theorem 9).

MSC classification

Secondary: 11B75: Other combinatorial number theory
Type
Research Article
Information
Mathematika , Volume 41 , Issue 1 , June 1994 , pp. 149 - 163
Copyright
Copyright © University College London 1994

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Erdōs, P., Ginzburg, A.Ziv, A.. Theorem in additive number theory. Bull Research Council Israel, 10F (1961), 41–43.Google Scholar
2.Davenport, H.. On addition of residue classes. Journal London Math. Soc., 10 (1935), 30–32.CrossRefGoogle Scholar
3.Bialostocki, A. and Dierker, P.. On the Erdős-Ginzburg-Ziv theorem and Ramsey numbers for stars and matchings. Discrete Math., 110 (1992), 1–8.Google Scholar
4.Bialostocki, A.Google Scholar
5.Füredi, Z. and Kleitman, D.Google Scholar