Title of article
On sums and products of distinct numbers
Author/Authors
Chang، نويسنده , , Mei-Chu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
6
From page
349
To page
354
Abstract
Let A be a set of k complex numbers, and let A+ (respectively, A×) be the set of sums (resp. products) of distinct elements of A. LetgC(k)=minA⊂C,|A|=k {|A+|+|A×|}.Ruzsa posed the question whether gC(k) grows faster than any power of k. In this note we give an affirmative answer to this question.
Keywords
Erd?s–Szemerédi , sumset , Productset
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2004
Journal title
Journal of Combinatorial Theory Series A
Record number
1530879
Link To Document