Continuant Diophantine equations

preprint2016arXivOpen access

Abstract

We investigate a family of Diophantine polynomial equations which involve continuant functions. In particular, given a polynomial P(x)∈Z[x]P(x)\in \mathbb{Z}[x] and n∈Nn\in \mathbb{N}, we consider the equation P(Kn(x1,…,xn))=Kn+1(x0,…,xn)Kn+1(x1,…,xn+1)P(K_n(x_1,\ldots, x_n)) = K_{n+1}(x_0,\ldots,x_n)K_{n+1}(x_1,\ldots, x_{n+1}). We show that with certain restrictions on P(x)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 nn and factorisations P(m)=d1d2P(m) = d_1d_2 for integers m,d1m,d_1 and d2d_2.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.