Continuant Diophantine equations

Abstract

We investigate a family of Diophantine polynomial equations which involve continuant functions. In particular, given a polynomial P(x)∈ Z[x] and n∈ N, we consider the equation P(Kn(x1,…, xn)) = Kn+1(x0,…,xn)Kn+1(x1,…, xn+1). We show that with certain restrictions on P(x) the set of its solutions has a rich structure. In particular, we provide several ways of generating new solutions from the existing ones. In the last section we discuss the relation between the solutions of the above Diophantine equation for arbitrary values of n and factorisations P(m) = d1d2 for integers m,d1 and d2.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…