The Cameron-Erdos Conjecture
classification
🧮 math.NT
math.CO
keywords
sum-freeansweringcameroncameron-erdosconjectureequationerdosintegers
read the original 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)).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.