On quantitative aspects of the unit sum number problem
β Scribed by Clemens Fuchs; Robert Tichy; Volker Ziegler
- Publisher
- Springer
- Year
- 2009
- Tongue
- English
- Weight
- 190 KB
- Volume
- 93
- Category
- Article
- ISSN
- 0003-889X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let NΓ°nΓ be the set of all integers that can be expressed as a sum of reciprocals of distinct integers 4n: Then we prove that for sufficiently large n; which improves the lower bound given by Croot. # 2002 Elsevier Science (USA)
Let Z. be the cyclic group of order n. For a sequence S of elements in Z~, we use f~(S) to denote the number of subsequences, the sum of whose elements is zero. In this paper, we give a characterization on the sequences S of elements in Zn for whichf~(S) < 2 Isl -" Γ· k -,, under the restriction 1 ~
In the well-known Subset Sum Problem, we are given positive integers a,, , a, and t and are to determine if some subset of the ai sums to t. We investigate the boundary between easy and hard variations of this problem. In particular, we consider the cases where the sequence 'A,~ .L' a,, \_\_\_ ,an i