Note on powers of 2 in sumsets (Q419109): Difference between revisions

Sumsets containing powers of \(2\) is an interesting problem in subset sums of integers. Erdős and Freud conjectured that if \(A \subset [1,n]\) is a set of integers and \(|A|>\frac{n}{3}\), then there exists a power of \(2\) which can be written as the sum of distinct elements of \(A\). This conjecture was confirmed later. Another important result on this problem was proved by Lev : If \(A \subset [1,n]\) and \(|A|\geq \frac{n}{2}+1\), there exists a power of \(2\) which can be represented as a sum of two elements of A. In this paper, the authors made a non-trivial progress on a conjecture of Pan: Let \(k, m, n \geq 2\) be integers, \(A\) be a normal subset of \([0,n]\), and \(|A|>\frac{1}{l+1}((2-\frac{k}{lm})n+2l)\), where \(l=\lceil\frac{k}{m}\rceil\). If \(m\geq 3\), or \(m=2\) and \(k\) is even, then \(kA\) contains a power of \(m\).