The Cameron-Erdos Conjecture

Details The Cameron-Erdos Conjecture The Cameron-Erdos Conjecture

2003-04-04

arxiv.org/abs/math/0304058v1

Mathematics

Number Theory

11 pages, to appear in Bull. London Math. Soc

Scientific paper

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)).

Affiliated with

Also associated with

No associations

Rating

The Cameron-Erdos Conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Cameron-Erdos Conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Cameron-Erdos Conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-385433