The Cameron-Erdős conjecture (Q941373): Difference between revisions

A set of integers \(A\) is called sum-free, if the sumset \(A+A\) is disjoint from \(A\). Let \(s(n)\) denote the number of sum-free subsets of the interval \([1,n]\). In 1988 \textit{P. J. Cameron} and \textit{P. Erdős} [Number Theory, Proc. 1st Conf. Can. Number Theory Assoc., Banff/Alberta (Can.) 1988, 61--79 (1990; Zbl 0695.10048)] conjectured the upper bound \(s(n)=O(2^{n/2})\) and proved some weaker results. After a number of papers written on the problem, the present work closes the problem by giving asymptotic formulas of the form \(s(n) \sim c2^{n/2}\) that work for even (resp. odd) \(n\) with different constants.