Only finitely many Tribonacci Diophantine triples exist
From MaRDI portal
Publication:5348240
Abstract: 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 such that are Tribonacci numbers. The proof depends on the Subspace theorem.
Recommendations
Cites work
Cited in
(8)- Diophantine quadruples in the sequence of shifted Tribonacci numbers
- Diophantine triples and k-generalized Fibonacci sequences
- Finiteness results for Diophantine triples with repdigit values
- Tribonacci numbers, \(S\)-units and Diophantine triples
- Diophantine triples in linear recurrences of Pisot type
- On \(k\)-generalized Fibonacci Diophantine triples
- Tribonacci Diophantine quadruples
- A polynomial variant of diophantine triples in linear recurrences
This page was built for publication: Only finitely many Tribonacci Diophantine triples exist
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348240)