Note on powers of 2 in sumsets
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.NEWLINENEWLINEAnother 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.NEWLINENEWLINEIn 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\).
- scientific article; zbMATH DE number 426337 (Why is no real title available?)
- scientific article; zbMATH DE number 568794 (Why is no real title available?)
- Note on integer powers in sumsets
- On two additive problems
- Powers of 2 with five distinct summands
- Representing powers of 2 by a sum of four integers
- Structure theorem for multiple addition and the Frobenius problem
- Sumsets containing long arithmetic progressions and powers of 2
- Sumsets containing powers of an integer
- Note on integer powers in sumsets
- Representing powers of 2 by a sum of four integers
- Sum and difference sets containing integer powers.
- The powers of two as sums over partitions
- Investigations in the powersum theory II
- Sumsets containing a term of a sequence
- An optimal lower bound for the size of the restricted sumsets containing powers
This page was built for publication: Note on powers of 2 in sumsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q419109)
