Bounds for multiplicative cosets over fields of prime order

Let m be a positive integer and suppose that p is an odd prime with p ≡ 1 mod m. Suppose that a ∈ (Z/pZ)∗ and consider the polynomial xm − a. If this polynomial has any roots in (Z/pZ)∗, where the coset representatives for Z/pZ are taken to be all integers u with |u| < p/2, then these roots will form a coset of the multiplicative subgroup μm of (Z/pZ)∗ consisting of the mth roots of unity mod p. Let C be a coset of μm in (Z/pZ)∗, and define |C| = maxu∈C |u|. In the paper “Numbers Having m Small mth Roots mod p” (Mathematics of Computation, Vol. 61, No. 203 (1993),pp. 393-413), Robinson gives upper bounds for M1(m, p) = minC∈(Z/pZ)∗/μm |C| of the form M1(m, p) < Kmp1−1/φ(m), where φ is the Euler phi-function. This paper gives lower bounds that are of the same form, and seeks to sharpen the constants in the upper bounds of Robinson. The upper bounds of Robinson are proven to be optimal when m is a power of 2 or when m = 6.