ON THE NUMBER OF SUM-FREE SETS

被引：29
|
作者：
CALKIN, NJ
机构：
[1] Department of Mathematics, Carnegie Mellon University, Pittsburgh, PA
来源：
BULLETIN OF THE LONDON MATHEMATICAL SOCIETY | 1990年 / 22卷
关键词：
D O I：
10.1112/blms/22.2.141
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Cameron and Erdos have considered the question: how many sum-free sets are contained in the first n integers;they have shown (personal communication) that the number of sum-free sets contained within the integers (Formula Presented) is c.2n/2. We prove that the number of sets contained within (1, 2,…, n) is (Formula Presented) for every (Formula Presented). © 1990 Oxford University Press.
引用
收藏
页码：141 / 144
页数：4
相关论文
共 50 条
12345