Only finitely many Tribonacci Diophantine triples exist
From MaRDI portal
Publication:5348240
DOI10.1515/MS-2017-0015zbMATH Open1440.11042arXiv1508.07760OpenAlexW2964238244MaRDI QIDQ5348240FDOQ5348240
Authors: Clemens Fuchs, Christoph Hutle, N. Irmak, Florian Luca, László Szalay
Publication date: 14 August 2017
Published in: Mathematica Slovaca (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1508.07760
Recommendations
Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Diophantine equations in many variables (11D72)
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
- On \(k\)-generalized Fibonacci Diophantine triples
- Diophantine triples in linear recurrences of Pisot type
- 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)