Representing powers of 2 by a sum of four integers (Q2563516)

Let \(n\) be a positive integer. Let \({\mathcal A} = \{1,2, \dots, n\}\), and let \({\mathcal B}\) be a subset of \({\mathcal A}\) with \(|B |> n/3\). \textit{P. Erdös} [Ann. N. Y. Acad. Sci. 576, 132-145 (1989; Zbl 0790.11015)] conjectured that there exists a power of 2 which can be represented by a sum of elements of \({\mathcal B}\). This conjecture was proved by \textit{P. Erdös} and \textit{G. Freiman} [J. Number Theory 34, No. 1, 1-12 (1990; Zbl 0697.10047)]. Further let \(M({\mathcal B})\) denote the minimal number of elements of \({\mathcal B}\), whose sum equals a power of 2. In this paper the author proves that \(M({\mathcal B}) \leq 4\). This is the best upper bound for \(M({\mathcal B})\), because \textit{N. Alon} [J. Number Theory 27, 196-205 (1987; Zbl 0622.10042)] showed that if \(n=3 k+1\), \(3k- 2=2^s\), and \({\mathcal B} = \{3,6, \dots, 3k\} \cup \{3k +1\}\), where \(k\) and \(s\) are positive integers with \(k\geq 4\), then \(M({\mathcal B}) >3\).