Diophantine triples and \(k\)-generalized Fibonacci sequences
DOI10.1007/s40840-016-0405-4zbMath1447.11054arXiv1602.08236OpenAlexW3101060140WikidataQ59461424 ScholiaQ59461424MaRDI QIDQ723617
Clemens Fuchs, Florian Luca, László Szalay, Christoph Hutle
Publication date: 24 July 2018
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.08236
Diophantine equationsgeneralized Fibonacci numbersDiophantine triplesapplication of the subspace theorem
Recurrences (11B37) Counting solutions of Diophantine equations (11D45) Diophantine equations in many variables (11D72) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Schmidt Subspace Theorem and applications (11J87)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear equations in variables which lie in a multiplicative group
- The Galois group of \(x^{n}-x^{n-1}-\cdots-x-1\)
- On a conjecture about repdigits in k-generalized Fibonacci sequences
- On an $S$-unit variant of Diophantine $m$-tuples
- Tribonacci Diophantine quadruples
- Lucas Diophantine Triples
- Diophantine triples with values in binary recurrences
- Fibonacci Diophantine triples
- There are only finitely many Diophantine quintuples
- Polynomial-exponential equations and linear recurrences
- Perfect powers in linear recurring sequences
- Only finitely many Tribonacci Diophantine triples exist
- A simplified Binet formula for k-generalized Fibonacci numbers
- Diophantine triples and reduced quadruples with the Lucas sequence of recurrence un=Aun-1-un-2
This page was built for publication: Diophantine triples and \(k\)-generalized Fibonacci sequences