论文信息 - Representing powers of 2 by a sum of four integers

Representing powers of 2 by a sum of four integers

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?

VSEVOLOD F. LEV | V. Lev

[1] P. Erdos. Some old and new problems on additive and combinatorial number theory , 1989 .

[2] András Sárközy,et al. Sumsets containing long arithmetic progressions and powers of 2 , 1989 .

[3] Gregory A. Freiman,et al. On two additive problems , 1990 .

[4] Paul Erdös. Some Problems and Results on Combinatorial Number Theory , 1989 .