On a sumset problem for integers (Q405084): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
Summary: 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|\geq5|A|-6 \) for \(|A|\geq5\). | |||
| Property / review text: Summary: 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|\geq5|A|-6 \) for \(|A|\geq5\). / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 11B30 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 11B13 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05E99 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 11P70 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6340111 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
additive combinatorics | |||
| Property / zbMATH Keywords: additive combinatorics / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
sumsets | |||
| Property / zbMATH Keywords: sumsets / rank | |||
Normal rank | |||
Revision as of 17:16, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a sumset problem for integers |
scientific article |
Statements
On a sumset problem for integers (English)
0 references
4 September 2014
0 references
Summary: 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|\geq5|A|-6 \) for \(|A|\geq5\).
0 references
additive combinatorics
0 references
sumsets
0 references
