On a sumset problem for integers

From MaRDI portal
Publication:405084




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(k1)2k!, where A+kcdotA=a+kb:a,binA. We also establish the inequality |A+4cdotA|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)