On Fibonacci numbers as sum of powers of two consecutive tribonacci numbers
DOI10.1007/s13398-022-01252-2zbMath1496.11024OpenAlexW4281653609MaRDI QIDQ2670724
Pavel Trojovský, Diego Marques, A. Kreutz
Publication date: 1 June 2022
Published in: Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A: Matemáticas. RACSAM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13398-022-01252-2
linear forms in logarithmsreduction methodDiophantine equationFibonacci numberLLL-algorithm\(k\)-generalized Fibonacci numbers
Exponential Diophantine equations (11D61) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Linear forms in logarithms; Baker's method (11J86)
Cites Work
- Fibonacci numbers at most one away from a perfect power
- Tribonacci numbers that are concatenations of two repdigits
- An exponential Diophantine equation related to powers of two consecutive Fibonacci numbers
- An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. II
- On a conjecture about repdigits in k-generalized Fibonacci sequences
- An exponential Diophantine equation related to the sum of powers of two consecutive k-generalized Fibonacci numbers
- A simplified Binet formula for k-generalized Fibonacci numbers
- On the sum of squares of consecutive $k$-bonacci numbers which are $l$-bonacci numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On Fibonacci numbers as sum of powers of two consecutive tribonacci numbers