Abstract
Given a smooth integer $q$, we use existing upper bounds for character sums to find a lower bound for the size of a multiplicative subgroup of the integers modulo $q$ which contains the image of an interval of consecutive integers $I \subset \mathbb{Z}\_q$ under a polynomial $f \in \mathbb{Z}\[X]$.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
