# Sum-Free Subset Results

# Sum-Free Subset Results

Join the DZone community and get the full member experience.

Join For FreeHortonworks Sandbox for HDP and HDF is your chance to get started on learning, developing, testing and trying out new features. Each download comes preconfigured with interactive tutorials, sample data and developments from the Apache community.

This posts gives some results for the sum-free subset problem in the previous post.

Paul Erdős proved in 1965 that a set of *n* non-zero integers contains a sum-free subset of size larger than *kn* where *k* = 1/3.

The best value of *k* is unknown. Erdős proved *k* is at least 1/3. Alon and Kleitman proved that *k*must be less than 12/29.

Alon and Kleitman also consider the problem of sum-free subsets of an arbitrary Abelian group. They proved that set of *n* non-zero elements of an Abelian group must have a sum-free subset of at least 2*n*/7 elements. The constant 2/7 is the best value in general. But for the specific case of the integers one can do better, since 1/3 > 2/7, but the best constant for the integer case is unknown.

Source: The Probabilistic Method

Hortonworks Community Connection (HCC) is an online collaboration destination for developers, DevOps, customers and partners to get answers to questions, collaborate on technical articles and share code examples from GitHub. Join the discussion.

Published at DZone with permission of John Cook , DZone MVB. See the original article here.

Opinions expressed by DZone contributors are their own.

## {{ parent.title || parent.header.title}}

## {{ parent.tldr }}

## {{ parent.linkDescription }}

{{ parent.urlSource.name }}