A Combinatorial Problem on Finite Abelian Groups

摘要

In this paper the following theorem is proved. LetGbe a finite Abelian group of ordern. Then,n+D(G)?1 is the least integermwith the property that for any sequence ofmelementsa1, …, aminG, 0 can be written in the form 0=a1+…+ain with 1 ≤i1<…