Papers
Topics
Authors
Recent
Search
2000 character limit reached

Continuant Diophantine equations

Published 25 Jul 2016 in math.NT | (1607.07212v1)

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.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.