Only finitely many Tribonacci Diophantine triples exist

Rok, strany: 2017, 853 - 862

Diophantine triples taking values in recurrence sequences have recently been studied quite a lot. In particular the question was raised whether or not there are finitely many Diophantine triples in the Tribonacci sequence. We answer this question here in the affirmative. We prove that there are only finitely many triples of integers $1≤ u < v < w$ such that $uv+1,uw+1,vw+1$ are Tribonacci numbers. The proof depends on the Subspace theorem.

ISO 690:

Fuchs, C., Hutle, C., Irmak, N., Luca, F., Szalay, L. 2017. Only finitely many Tribonacci Diophantine triples exist. In Mathematica Slovaca, vol. 67, no.4, pp. 853-862. 0139-9918. DOI: https://doi.org/10.1515/ms-2017-0015

APA:

Fuchs, C., Hutle, C., Irmak, N., Luca, F., Szalay, L. (2017). Only finitely many Tribonacci Diophantine triples exist. Mathematica Slovaca, 67(4), 853-862. 0139-9918. DOI: https://doi.org/10.1515/ms-2017-0015