Results 161 to 170 of about 1,467 (207)
Some of the next articles are maybe not open access.
On Concatenations of Fibonacci and Lucas Numbers
Bulletin of the Iranian Mathematical Society, 2022Let \( (F_n)_{n\ge 0} \) and \( (L_n)_{n\ge 0} \) be the usual Fibonacci and Lucas sequences defined respectively by the linear recurrence relations: \( F_0=0 \), \( F_1=1 \), \( F_{n+2}=F_{n+1}+F_n \) and \( L_0=2 \), \( L_1=1 \), \( L_{n+2}=L_{n+1}+L_n \) for all \( n\ge 0 \).
Murat Alan
exaly +3 more sources
Power sums of Fibonacci and Lucas numbers
Quaestiones Mathematicae, 2011 Polynomial representation formulae for power sums of the extended Fibonacci-Lucas numbers are established, which include, as special cases, four for-mulae for odd power sums of Melham type on Fibonacci and Lucas numbers, obtained recently by Ozeki and Prodinger (2009).Quaestiones Mathematicae 34(2011), 75 ...
Chu, Wenchang, Li, Nadia N
openaire +3 more sources
Fibonacci numbers as mixed concatenations of Fibonacci and Lucas numbers
Mathematica SlovacaAbstractLet (Fn)n≥0and (Ln)n≥0be the Fibonacci and Lucas sequences, respectively. In this paper we determine all Fibonacci numbers which are mixed concatenations of a Fibonacci and a Lucas numbers. By mixed concatenations ofaandb, we mean the both concatenationsabandbatogether, whereaandbare any two nonnegative integers.
Altassan, Alaa, ALAN, Murat
openaire +3 more sources
2021
In the literature, the Fibonacci numbers are usually denoted by \(F_n\), but this symbol is already reserved for the Fermat numbers in this book. So we will denote them by \(K_n\). The sequence of Fibonacci numbers \(\,\,(K_n)_{n=0}^\infty \,\,\) starts with \(K_0=0\) and \(K_1=1\) and satisfies the recurrence.
Michal Křížek +2 more
openaire +1 more source
In the literature, the Fibonacci numbers are usually denoted by \(F_n\), but this symbol is already reserved for the Fermat numbers in this book. So we will denote them by \(K_n\). The sequence of Fibonacci numbers \(\,\,(K_n)_{n=0}^\infty \,\,\) starts with \(K_0=0\) and \(K_1=1\) and satisfies the recurrence.
Michal Křížek +2 more
openaire +1 more source
Perfect fibonacci and lucas numbers
Rendiconti del Circolo Matematico di Palermo, 2000Using elementary means, the author shows that no Fibonacci or Lucas number is perfect.
openaire +2 more sources
On matrices related with Fibonacci and Lucas numbers
Applied Mathematics and Computation, 2008In this paper, we obtain some new results on matrices related with Fibonacci numbers and Lucas numbers. Also, we derive the relation between Pell numbers and its companion sequence by using our representations.
Xudan Fu, Xia Zhou
openaire +2 more sources
1997
Consider the following number trick–try it out on your friends. You ask them to write down the numbers from 0 to 9. Against 0 and 1 they write any two numbers (we suggest two fairly small positive integers just to avoid tedious arithmetic, but all participants should write the same pair of numbers).
Peter Hilton +2 more
openaire +1 more source
Consider the following number trick–try it out on your friends. You ask them to write down the numbers from 0 to 9. Against 0 and 1 they write any two numbers (we suggest two fairly small positive integers just to avoid tedious arithmetic, but all participants should write the same pair of numbers).
Peter Hilton +2 more
openaire +1 more source
On Fibonacci search method with k-Lucas numbers
Applied Mathematics and Computation, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yildiz, B, Karaduman, E
openaire +2 more sources
On the representation of k-generalized Fibonacci and Lucas numbers
Applied Mathematics and Computation, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahmet Ali Öcal +2 more
openaire +3 more sources