A Combinatorial Problem on Finite Abelia
โ
W.D. Gao
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 186 KB
In this paper the following theorem is proved. Let G be a finite Abelian group of order n. Then, n+D(G )&1 is the least integer m with the property that for any sequence of m elements a 1 , ..., a m in G, 0 can be written in the form 0= a 1 + } } } +a in with 1 i 1 < } } } <i n m, where D(G) is the