arXiv · math/0304058
The Cameron-Erdos Conjecture
Abstract
A set A of integers is said to be sum-free if there are no solutions to the equation x + y = z with x,y and z all in A. Answering a question of Cameron and Erdos, we show that the number of sum-free subsets of {1,...,N} is O(2^(N/2)).
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ben Green. 2003-04-04. The Cameron-Erdos Conjecture. https://arxiv.org/abs/math/0304058
Cite the original work for its findings. Save a collection to share your selection of sources.