Note on integer powers in sumsets (Q2490155): Difference between revisions

Let \(k,m,n\geq 2\) be integers and \(A\subset \{0,1,2,\dots,n\}\) with \(0\in A\). The author proves that if the greatest common divisor of all elements of \(A\) is one, \(| A| >(1/(l+1))\left((2-(k/(lm))n+2l)\right)\) where \(l=\lceil k/m\rceil\) and \(m\geq 3\) or \(m=2\) and \(k\) is even, then there exists a power of \(m\) which can be represented as a sum of \(k\) (not necessarily distinct) elements of \(A\). On the other hand, for \(k=2\) he proves a little stronger result: if \(m\geq 2\), \(n\) is a positive integer and \(| A| \geq (1-1/m)n\) if \(n\geq m\geq 4\) with \(m\) even, or \(| A| \geq (1-1/m)n+1\) otherwise, then there exists a power of \(m\) which can be represented as a sum of two (again not necessarily distinct) elements of \(A\). These results extend those of \textit{T. Abe} [Combinatorica 24, No. 1, 1--4 (2004; Zbl 1049.11011)] and \textit{V. F. Lev} [ibid. 16, No. 3, 413--416 (1996; Zbl 0862.11008)].