Results 261 to 270 of about 625,251 (324)
Some of the next articles are maybe not open access.
Chaos, Solitons & Fractals, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Songül Çelik +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Songül Çelik +2 more
openaire +1 more source
Lucas Numbers and Determinants
Integers, 2012Abstract.In this article, we present two infinite dimensional matrices whose entries are recursively defined, and show that the sequence of their principal minors form the Lucas sequence, that ...
Moghaddamfar, Alireza +1 more
openaire +2 more sources
Optimization by k-Lucas numbers
Applied Mathematics and Computation, 2008The well-known Fibonacci search method to find the maximum point of unimodal functions on closed intervals is modified by using \(k\)-Lucas numbers. This makes the Fibonacci search method more effective and improves an earlier algorithm by \textit{B. Yildiz} and \textit{E. Karaduman} [Appl. Math. Comput. 143, No. 2--3, 523--551 (2003; Zbl 1041.11013)].
ÖMÜR, NEŞE +2 more
openaire +3 more sources
On quaternion‐Gaussian Lucas numbers
Mathematical Methods in the Applied Sciences, 2020In this study, we have considered Gaussian Lucas numbers and given the properties of these numbers. Then, we have defined the quaternions that accept these numbers as coefficients. We have examined whether the numbers defined provide some identities for quaternions in the literature.
openaire +2 more sources
The Fibonacci Quarterly, 1972 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