Abstract

Given a prime p >= 5 and an integer s >= 1,we show that there exists an integer M such that for any quadratic polynomial f with coefficients in the ring of integers modulo p(S), such that f is not a square, if a sequence (f(l), ... f(N)) is a sequence of squares, then N is at most M. We also provide some explicit formulas for the optimal M.