Zero-Sum Problem
Versandfertig in 6-10 Tagen
26,99 €
inkl. MwSt.
PAYBACK Punkte
13 °P sammeln!
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In number theory, zero-sum problems are a certain class of combinatorial questions. In general, a finite abelian group G is considered. The zero-sum problem for the integer n is the following: Find the smallest integer k such that any sequence of elements of G with length k contains n terms that sum to 0. Explicitly this says that any multiset of 2n 1 integers has a subset of size n the sum of whose elements is a multiple of n. This result is generally known as the EG...
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In number theory, zero-sum problems are a certain class of combinatorial questions. In general, a finite abelian group G is considered. The zero-sum problem for the integer n is the following: Find the smallest integer k such that any sequence of elements of G with length k contains n terms that sum to 0. Explicitly this says that any multiset of 2n 1 integers has a subset of size n the sum of whose elements is a multiple of n. This result is generally known as the EGZ theorem after its discoverers. More general results than this theorem exist, such as Olson''s theorem, Kemnitz''s conjecture (proved by Christian Reiher in 2003), and the weighted EGZ theorem (proved by David J. Grynkiewicz in 2005).
