Polynomial quotients: Interpolation, value sets and Waring's problem
For an odd prime p and an integer w ≥ 1, polynomial quotients are defined by with , u ≥ 0, which are generalizations of Fermat quotients . First, we estimate the number of elements for which for a given polynomial f(x) over the finite field . In particular, for the case f(x)=x we get bounds on the number of fixed points of polynomial quotients. Second, before we study the problem of estimating the smallest number (called the Waring number) of summands needed to express each element of...