Displaying similar documents to “Gelin-Cesáro identities for Fibonacci and Lucas quaternions”

An inequality for Fibonacci numbers

Horst Alzer, Florian Luca (2022)

Mathematica Bohemica

Similarity:

We extend an inequality for Fibonacci numbers published by P. G. Popescu and J. L. Díaz-Barrero in 2006.

On Balancing and Lucas-balancing Quaternions

Bijan Kumar Patel, Prasanta Kumar Ray (2021)

Communications in Mathematics

Similarity:

The aim of this article is to investigate two new classes of quaternions, namely, balancing and Lucas-balancing quaternions that are based on balancing and Lucas-balancing numbers, respectively. Further, some identities including Binet's formulas, summation formulas, Catalan's identity, etc. concerning these quaternions are also established.

Binomials transformation formulae for scaled Fibonacci numbers

Edyta Hetmaniok, Bożena Piątek, Roman Wituła (2017)

Open Mathematics

Similarity:

The aim of the paper is to present the binomial transformation formulae of Fibonacci numbers scaled by complex multipliers. Many of these new and nontrivial relations follow from the fundamental properties of the so-called delta-Fibonacci numbers defined by Wituła and Słota. The paper contains some original relations connecting the values of delta-Fibonacci numbers with the respective values of Chebyshev polynomials of the first and second kind.

Fibonacci Numbers with the Lehmer Property

Florian Luca (2007)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

We show that if m > 1 is a Fibonacci number such that ϕ(m) | m-1, where ϕ is the Euler function, then m is prime

Determinants and inverses of circulant matrices with complex Fibonacci numbers

Ercan Altınışık, N. Feyza Yalçın, Şerife Büyükköse (2015)

Special Matrices

Similarity:

Let ℱn = circ (︀F*1 , F*2, . . . , F*n︀ be the n×n circulant matrix associated with complex Fibonacci numbers F*1, F*2, . . . , F*n. In the present paper we calculate the determinant of ℱn in terms of complex Fibonacci numbers. Furthermore, we show that ℱn is invertible and obtain the entries of the inverse of ℱn in terms of complex Fibonacci numbers.