Recent Issues
Volume 14, Issue 1
Volume 13, Issue 4
Volume 13, Issue 3
Volume 13, Issue 2
Volume 13, Issue 1
Volume 12, Issue 4
Volume 12, Issue 3
Volume 12, Issue 2
Volume 12, Issue 1
Volume 11, Issue 4
Volume 11, Issue 3
Volume 11, Issue 2
Volume 11, Issue 1
Volume 10, Issue 4
Volume 10, Issue 3
Volume 10, Issue 2
Volume 10, Issue 1
Volume 9, Issue 4
Volume 9, Issue 3
Volume 9, Issue 2
Volume 9, Issue 1
Volume 8, Issue 4
Volume 8, Issue 3
Volume 8, Issue 2
Volume 8, Issue 1
Older Issues
Volume 7, Issue 4
Volume 7, Issue 3
Volume 7, Issue 2
Volume 7, Issue 1
Volume 6, Issue 4
Volume 6, Issue 2-3
Volume 6, Issue 1
Volume 5, Issue 4
Volume 5, Issue 3
Volume 5, Issue 1-2
Volume 4, Issue 4
Volume 4, Issue 3
Volume 4, Issue 2
Volume 4, Issue 1
Volume 3, Issue 3-4
Volume 3, Issue 2
Volume 3, Issue 1
Volume 2, Issue 4
Volume 2, Issue 3
Volume 2, Issue 2
Volume 2, Issue 1
Volume 1, Issue 4
Volume 1, Issue 3
Volume 1, Issue 2
Volume 1, Issue 1
Abstract
Let
p be a large enough
prime number. When
A
is a subset of
F p
\ { 0 }
of cardinality
| A |
> ( p
+ 1 ) ∕ 3 ,
then an application of the Cauchy–Davenport theorem gives
F p
\ { 0 } ⊂
A ( A
+
A ) .
In this note, we improve on this and we show that
| A | ≥ 0 . 3 0 5 1 p implies
A ( A
+
A )
⊇ F p
\ { 0 } .
In the opposite direction we show that there exists a set
A such
that
| A |
> ( 1
8
+
o ( 1 ) ) p
and
F p
\ { 0 } ⊈ A ( A
+
A ) .
Keywords
sum-product estimates, arithmetic combinatorics, finite
fields
Mathematical Subject Classification 2010
Primary: 11B75
Milestones
Received: 21 November 2018
Revised: 14 December 2018
Accepted: 29 March 2019
Published: 20 May 2019