Fuchs, ClemensHutle, ChristophIrmak, NurettinLuca, FlorianSzalay, Laszlo2024-11-072024-11-0720170139-99181337-2211https://doi.org/10.1515/ms-2017-0015https://hdl.handle.net/11480/15993Diophantine 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.eninfo:eu-repo/semantics/openAccessDiophantine triplesTribonacci numbersDiophantine equationsapplication of the Subspace theoremArticle67485386210.1515/ms-2017-00152-s2.0-85026639635Q2WOS:000407235100004Q4