We obtain a lower bound on the size of the value set f(𝔽p) of a sparse polynomial f(x) in 𝔽p[x] over a finite field of p elements when p is prime. This bound is uniform with respect to the degree and depends on the number of terms of f.

This video is part of the Number Theory Web Seminar series.