Irmak, Nurettin2023-05-312023-05-3120231607-36061727-933Xhttps://doi.org/10.2989/16073606.2023.2178983https://hdl.handle.net/20.500.13091/4253Article; Early AccessRecently, Luca and Szalay solved the equation (2(k) - 1) (3(l )- 1) = 5(m) - 1. Motivated by this equation, we show that the solutions of the equation (F-n(k) -1) (F-n+1(l)-1) = F-n+2 (m)- 1 are (n, k, l, m) = (3, 2, 2, 2) and (5, 2, 1, 2). Here F-n is the n(th) Fibonacci number. To prove this, the main tools are linear forms in logarithm of algebraic numbers and the Lenstra-Lenstra-Lovasz (LLL) lattice basis reduction algorithm.eninfo:eu-repo/semantics/closedAccessFibonacci numberexponential diophantine equationArticle10.2989/16073606.2023.21789832-s2.0-85149798978