登入選單
返回Google圖書搜尋
註釋A conjecture by Erdős and Lemke in elementary number theory goes as follows: If d is a divisor of n and we have d divisors of n, say a1,...,a[subscript d], not necessarily distinct, we can always find a subsequence among them such that their sum is (i) divisible by d, and (ii) at most n. -- This was proved by Lemke and Kleitman to be indeed the case. They also noted that an equivalent version of their theorem, stated in terms of the additive cyclic group G = the set of integers modulo n is as follows: Every sequence of n elements of G, not necessarily distinct, contains a subsequence g1,...,g[subscript k] such that g1+...+g[subscript k] = 0 and [summation equation]