Squares in sumsets

Abstract

A finite set A of integers is square-sum-free if there is no subset of A sums up to a square. In 1986, Erdős posed the problem of determining the largest cardinality of a square-sum-free subset of {1, …, n}. Answering this question, we show that this maximum cardinality is of order n1/3+0(1).