2000 character limit reached
A coprimality condition on consecutive values of polynomials
Published 6 Apr 2017 in math.NT | (1704.01738v1)
Abstract: Let $f\in\mathbb{Z}[X]$ be quadratic or cubic polynomial. We prove that there exists an integer $G_f\geq 2$ such that for every integer $k\geq G_f$ one can find infinitely many integers $n\geq 0$ with the property that none of $f(n+1),f(n+2),\dots,f(n+k)$ is coprime to all the others. This extends previous results on linear polynomials and, in particular, on consecutive integers.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.