On two additive problems
Let \({\mathcal A}\) be a set of nonnegative integers. P. Erdős and R. Freud conjectured that if \({\mathcal A}\) satisfies \({\mathcal A}\subset \{1,2,...,3n\}\) and \(|{\mathcal A}| \geq n+1\) then there is a power of 2 that can be written as a sum of distinct elements of \({\mathcal A}\). Very similarly if \({\mathcal A}\subset \{1,2,...,4n\}\) and \(|{\mathcal A}| \geq n+1\) then there is a square-free number that can be written as a sum of distinct elements of \({\mathcal A}\). Both problems are answered in the affirmative in this paper. The proof is based on the Hardy-Littlewood method and elementary considerations. In this way at least \(c\log n\) summands from \({\mathcal A}\) are necessary. Recently, \textit{M. B. Nathanson} and \textit{A. Sárközy} [Acta Arith. 54, 147-154 (1989; Zbl 0693.10040)] showed that a bounded number of summands for \({\mathcal A}\) is enough.
- Sumsets containing infinite arithmetic progressions
- On consecutive subset sums
- Two zero-sum problems and multiple properties
- Sets whose sumset avoids a thin sequence
- The largest projective cube-free subsets of \(\mathbb{Z}_{2^n}\)
- Note on integer powers in sumsets
- Representing powers of 2 by a sum of four integers
- Squarefree numbers in sumsets
- On an additive-number-theoretic problem of P. Erdős
- Sumsets and difference sets containing a common term of a sequence
- scientific article; zbMATH DE number 426337 (Why is no real title available?)
- scientific article; zbMATH DE number 3163845 (Why is no real title available?)
- scientific article; zbMATH DE number 5150847 (Why is no real title available?)
- scientific article; zbMATH DE number 4075216 (Why is no real title available?)
- Note on powers of 2 in sumsets
- scientific article; zbMATH DE number 4116650 (Why is no real title available?)
- Sum and difference sets containing integer powers.
- The 392 problem
- The largest (k,\ell )-sum-free subsets
- Powers of 2 with five distinct summands
- Sumsets without powerful numbers
- On divisibility properties of integers of the form \(ab+1\)
- On the restricted sumsets containing powers of an integer
- Sumsets containing a term of a sequence
- On the sum of two powered numbers
- Fast exact and approximate algorithms for k-partition and scheduling independent tasks
- On subset sums of \(r\)-sets
- Optimal result on restricted sumsets containing powers of two
- An optimal lower bound for the size of the restricted sumsets containing powers
- On a conjecture of Alon
- Subset-sum problems with different summands: Computation
This page was built for publication: On two additive problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911638)
