摘要
对sum-avoiding子集进行推广,对任意正整数k(k 2),若集合S是A■N的一个子集,且S中任意k个元素的和都不属于A,则S称为集合A的k-sum-avoiding子集.估计了当|A|=n时,A的k-sum-avoiding子集S的最大基数.
For a positive integer k, we call a subset S A k-sum-avoiding, if any sum of k distinct elements taken from S does not belong to A. In this paper, we estimate the maximal cardinality of k-sum-avoiding subsets S of A when|A|=n.
出处
《纯粹数学与应用数学》
CSCD
2014年第5期507-511,共5页
Pure and Applied Mathematics