English

On a sumset problem for integers

Combinatorics 2014-02-21 v2 Number Theory

Abstract

Let AA be a finite set of integers. We show that if kk is a prime power or a product of two distinct primes then A+kA(k+1)Ak(k+2)/4|A+k\cdot A|\geq(k+1)|A|-\lceil k(k+2)/4\rceil provided A(k1)2k!|A|\geq (k-1)^{2}k!, where A+kA={a+kb: a,bA}A+k\cdot A=\{a+kb:\ a,b\in A\}. We also establish the inequality A+4A5A6|A+4\cdot A|\geq 5|A|-6 for A5|A|\geq 5.

Keywords

Cite

@article{arxiv.1011.5438,
  title  = {On a sumset problem for integers},
  author = {Shan-Shan Du and Hui-Qin Cao and Zhi-Wei Sun},
  journal= {arXiv preprint arXiv:1011.5438},
  year   = {2014}
}

Comments

Final published version

R2 v1 2026-06-21T16:48:34.960Z