On a sumset problem for integers

Details On a sumset problem for integers On a sumset problem for integers

2010-11-24

arxiv.org/abs/1011.5438v1

Mathematics

Combinatorics

20 pages

Scientific paper

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|\geq 5|A|-6 $ for
$|A|\geq 5$.

Affiliated with

Also associated with

No associations

Rating

On a sumset problem for integers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On a sumset problem for integers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On a sumset problem for integers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-241513