Abstract
We solve an arithmetic problem due to Erdös and Freud (1986) investigated also by Freiman, Nathanson and Sárközy: How many elements from a given set of integers one must take to represent a power of 2 by their sum?
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Alon: Subset sums,J. Number Theory,27 (1987), 196–205.
P. Erdős: Some problems and results on combinatorial number theory,Ann. New York Acad. Sc.,576 (1989), 132–145.
P. Erdős andG. Freiman: On two additive problems,J. Number Theory,34 (1990), 1–12
G. A. Freiman:Foundation of a structural theory of set addition (Kazan, 1966) [Russian]; or:Translation of Math. Monographs,37 (American Math. Soc., Providence, R.I., 1973).
G. A. Freiman: Sumsets and powers of 2, in:Colloq. Math. Soc. János Bolyai,60 (1992) (North-Holland, Amsterdam).
M. Nathanson andA. Sárközy: Sumsets containing long arithmetic progressions and powers of 2,Acta Arith.,54 (1989), 147–154.