Optimal bounds for B\"uchi's problem in modular arithmetic II
Abstract
Given a prime p5 and an integer s1, we show that there exists an integer M such that for any quadratic polynomial f with coefficients in the ring of integers modulo ps, such that f is not a square, if a sequence (f(1),…,f(N)) is a sequence of squares, then N is at most M. We obtain this result by reducing to the case where f has an invertible dominant coefficient.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.