scientific article; zbMATH DE number 2058333
Fibonacci numbers \(F_n\) and Lucas numbers \(L_n\) are defined recursively by \(F_{n+2}= F_{n+1}+ F_n\) with \(F_0= 0\), \(F_1=1\) and \(L_{n+2}= L_{n+1}+ L_n\) with \(L_0= 2\), \(L_1=1\), respectively. \textit{P. Filipponi} and \textit{O. Brugia} [Fibonacci Q. 37, No. 3, 262--264 (1999; Zbl 0949.11008)] asked which \(F_n\) and \(L_n\) are of the form \(n(n-1)-1\). By the famous Thue theorem, it is easy to verify that there are only finitely many such \(F_n\) and \(L_n\). In this paper, using elementary methods, the author shows that if \(L_n\) is of the above form, then \(L_n\equiv\pm1\pmod{16}\) except for \(L_5=11\) and \(L_7=29\). Note that, as indicated by Filipponi and Brugia, the fact that \(L_n\) with even \(n\) cannot be such a number, is evident.
- Generalized Lucas numbers of the form \(wx^{2}\) and \(wV_{m}x^{2}\)
- scientific article; zbMATH DE number 4051716 (Why is no real title available?)
- scientific article; zbMATH DE number 3775618 (Why is no real title available?)
- scientific article; zbMATH DE number 1175386 (Why is no real title available?)
- Fibonacci numbers at most one away from a perfect power
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4456575)
