pith. sign in

arxiv: 1905.01411 · v1 · pith:AILD2R43new · submitted 2019-05-04 · 🧮 math.NT

Optimal bounds for B\"uchi's problem in modular arithmetic II

classification 🧮 math.NT
keywords integersequencearithmeticboundscasecoefficientcoefficientsdominant
0
0 comments X
read the original abstract

Given a prime $p\ge5$ and an integer $s\ge1$, 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(1),\dots,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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.