Wolfram Researchmathworld.wolfram.comOther Wolfram Sites
Search Site

INDEX
Algebra
Applied Mathematics
Calculus and Analysis
Discrete Mathematics
Foundations of Mathematics
Geometry
History and Terminology
Number Theory
Probability and Statistics
Recreational Mathematics
Topology
Alphabetical Index

ABOUT THIS SITE
About MathWorld
About the Author
Terms of Use

DESTINATIONS
What's New
Headline News (RSS)
Random Entry
Animations
Live 3D Graphics

CONTACT
Email Comments
Contribute!
Sign the Guestbook

MATHWORLD - IN PRINT
Order book from Amazon

Cauchy-Davenport Theorem

Let t be a nonnegative integer and let , ..., be nonzero elements of which are not necessarily distinct. Then the number of elements of that can be written as the sum of some subset (possibly empty) of the is at least . In particular, if , then every element of can be so written.

Links search




References

Martin, G. "Dense Egyptian Fractions." Trans. Amer. Math. Soc. 351, 3641-3657, 1999.

Vaughan, R. C. Lemma 2.14 in The Hardy-Littlewood Method, 2nd ed. Cambridge, England: Cambridge University Press, 1997.




cite this as

Eric W. Weisstein. "Cauchy-Davenport Theorem." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/Cauchy-DavenportTheorem.html



header
mathematica calculationcenter