289 research outputs found
Polynomial sequences on quadratic curves
In this paper we generalize the study of Matiyasevich on integer points over
conics, introducing the more general concept of radical points. With this
generalization we are able to solve in positive integers some Diophantine
equations, relating these solutions by means of particular linear recurrence
sequences. We point out interesting relationships between these sequences and
known sequences in OEIS. We finally show connections between these sequences
and Chebyshev and Morgan-Voyce polynomials, finding new identities
On the intersections of Fibonacci, Pell, and Lucas numbers
We describe how to compute the intersection of two Lucas sequences of the
forms or
with that includes sequences of Fibonacci, Pell, Lucas, and
Lucas-Pell numbers. We prove that such an intersection is finite except for the
case and and the case of two -sequences when the
product of their discriminants is a perfect square. Moreover, the intersection
in these cases also forms a Lucas sequence. Our approach relies on solving
homogeneous quadratic Diophantine equations and Thue equations. In particular,
we prove that 0, 1, 2, and 5 are the only numbers that are both Fibonacci and
Pell, and list similar results for many other pairs of Lucas sequences. We
further extend our results to Lucas sequences with arbitrary initial terms
Coincidences in generalized Lucas sequences
For an integer , let be the generalized
Lucas sequence which starts with ( terms) and each term
afterwards is the sum of the preceding terms. In this paper, we find all
the integers that appear in different generalized Lucas sequences; i.e., we
study the Diophantine equation in nonnegative integers
with . The proof of our main theorem uses lower
bounds for linear forms in logarithms of algebraic numbers and a version of the
Baker-Davenport reduction method. This paper is a continuation of the earlier
work [4].Comment: 14 page
Diophantine triples in linear recurrence sequences of Pisot type
The study of Diophantine triples taking values in linear recurrence sequences
is a variant of a problem going back to Diophantus of Alexandria which has been
studied quite a lot in the past. The main questions are, as usual, about
existence or finiteness of Diophantine triples in such sequences. Whilst the
case of binary recurrence sequences is almost completely solved, not much was
known about recurrence sequences of larger order, except for very specialized
generalizations of the Fibonacci sequence. Now, we will prove that any linear
recurrence sequence with the Pisot property contains only finitely many
Diophantine triples, whenever the order is large and a few more not very
restrictive conditions are met.Comment: 25 pages. arXiv admin note: text overlap with arXiv:1602.0823
- …