Counting Generalized Sum-Free Sets
β
Neil J Calkin; Jan McDonald Thomson
π
Article
π
1998
π
Elsevier Science
π
English
β 327 KB
We show that the number of subsets of [1, 2, ..., n] with no solution to x 1 +x 2 + } } } +x k = y 1 + y 2 + } } } + y l for k 4l&1 is at most c 2 %n where %=(k&l)Γk. 1998 Academic Press ## 1. Introduction A set S of positive integers is sum-free if x+ y=z has no solution in S. Similarly, a set S