Abstract
Consider the sequence {Fn}n≥0 of Fibonacci numbers defined by F= 0 , F1= 1 , and Fn+2= Fn+1+ Fn for all n≥ 0. In this paper, we find all integers c having at least two representations as a difference between a Fibonacci number and a power of 3
Original language | English |
---|---|
Pages (from-to) | 263-277 |
Number of pages | 15 |
Journal | Boletín de la Sociedad Matemática Mexicana |
Volume | 26 |
Issue number | 2 |
Early online date | 17 Sept 2019 |
DOIs | |
Publication status | Published - 1 Jul 2020 |
Keywords
- Fibonacci number
- Linear forms in logarithms
- Baker's method
ASJC Scopus subject areas
- Algebra and Number Theory