On a sumset problem for integers
classification
🧮 math.CO
math.NT
keywords
cdotintegersdistinctestablishfiniteinequalitylceilpower
read the original 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+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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.