Abstract

Abstract A set A of integers is called sum-free if a + b ∉ A for any a, b ∈ A. For an arbitrary Ɛ > 0, let sƐ(n) denote the number of sum-free sets in the segment [(1/4 + Ɛ)n, n]. We prove that for any Ɛ > 0 there exists a constant c = c(Ɛ) such that sƐ(n) ≤ c2n/2. This research was supported by the Russian Foundation for Basic Research, grant 01-01-00266.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.