On a sumset problem for integers

From MaRDI portal



Abstract: Let A be a finite set of integers. We show that if k is a prime power or a product of two distinct primes then |A+kcdot A|geq(k+1)|A|-lceil k(k+2)/4 ceil provided |A|geq(k−1)2k!, where A+kcdotA=a+kb:a,binA. We also establish the inequality |A+4cdotA|geq5|A|−6 for |A|geq5.


Summary: Let \(A\) be a finite set of integers. We show that if \(k\) is a prime power or a product of two distinct primes then \[ |A+k\cdot A|\geq(k+1)|A|-\lceil k(k+2)/4\rceil \] provided \(|A|\geq (k-1)^{2}k!\), where \(A+k\cdot A=\{a+kb:\;a,b\in A\}\). We also establish the inequality \(|A+4\cdot A|\geq5|A|-6 \) for \(|A|\geq5\).











This page was built for publication: On a sumset problem for integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405084)