Premium
On the Number of Sum‐Free Sets
Author(s) -
Calkin Neil J.
Publication year - 1990
Publication title -
bulletin of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.396
H-Index - 48
eISSN - 1469-2120
pISSN - 0024-6093
DOI - 10.1112/blms/22.2.141
Subject(s) - mathematics , combinatorics , discrete mathematics
Cameron and Erdős 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 {⅓ n , ⅓ n + 1, …, n } is c .2 n /2 . We prove that the number of sets contained within {l, 2, …,n} is o (2 n (½+ε) ) for every ε > 0.