Counting Sets of Integers, No k of Which Sum to Another
Loading...
Author(s)
Calkin, Neil J.
Taylor, Angela C.
Advisor(s)
Editor(s)
Collections
Supplementary to:
Permanent Link
Abstract
We show that for every k greater or equal than 3 the number of subsets of {1,2,...,n}
containing no solution to x_1 + x_2 + ... + x_k = y, where the x_i need not
be distinct, is at most c2^{\alpha n}, where \alpha = (k-1)/k.
Sponsor
Date
1995-07
Extent
Resource Type
Text
Resource Subtype
Pre-print