I'm doing a presentation on using probability to prove various results, and one of them is that given any set of natural numbers B, it contains a set A that is sum-free, i.e. no two elements in A sum to another element in A, such that [tex] |A| \geq \frac{|B|}{3}[/tex].(adsbygoogle = window.adsbygoogle || []).push({});

I looked around and found a slightly better result that there is always a sum free subset of B of magnitude [tex] |A| \geq \frac{|B+2|}{3}[/tex]. I've been trying to construct an example for B that gets this bound or close to it, but it's not working out so well. Does anyone know of a good example of such a set, or if there's a better bound that's known?

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Sumfree subsets

Loading...

Similar Threads - Sumfree subsets | Date |
---|---|

I For groups, showing that a subset is closed under operation | Feb 20, 2017 |

Some subset of a generating set is a basis | Sep 30, 2013 |

Is a finite semigroup isomorphic to subsets of some group? | Jul 24, 2013 |

Subset requirements? | May 9, 2013 |

**Physics Forums - The Fusion of Science and Community**