On a sumset problem for integers

From MaRDI portal
Publication:405084

zbMATH Open1308.11010arXiv1011.5438MaRDI QIDQ405084FDOQ405084


Authors: Shan-Shan Du, Hui-Qin Cao, Zhi-Wei Sun Edit this on Wikidata


Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1011.5438

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Cited In (17)





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)