No CrossRef data available.
Published online by Cambridge University Press: 26 February 2010
Let p be a prime and let F be a polynomial in one variable with coefficients in GF(p), the field of p elements. Let d be the degree of F, and let r+1 denote the number of distinct values F(µ) as µ. ranges over GF(p). A generalization of the Waring problem modulo p leads to the question the determination of a lower bound for r.