Results 31 to 40 of about 1,467 (207)

Repdigits as difference of two Fibonacci or Lucas numbers

Математичні Студії, 2021
In the present study we investigate all repdigits which are expressed as a difference of two Fibonacci or Lucas numbers. We show that if $F_{n}-F_{m}$ is a repdigit, where $F_{n}$ denotes the $n$-th Fibonacci number, then $(n,m)\in \{(7,3),(9,1),(9,2 ...
P. Ray, K. Bhoi
doaj   +1 more source

A New Method of Matrix Decomposition to Get the Determinants and Inverses of r-Circulant Matrices with Fibonacci and Lucas Numbers

Journal of Mathematics, 2021
We use a new method of matrix decomposition for r-circulant matrix to get the determinants of An=CircrF1,F2,…,Fn and Bn=CircrL1,L2,…,Ln, where Fn is the Fibonacci numbers and Ln is the Lucas numbers.
Jiangming Ma, Tao Qiu, Chengyuan He
doaj   +1 more source

On Generalized Jacobsthal and Jacobsthal–Lucas Numbers

Annales Mathematicae Silesianae, 2022
Jacobsthal numbers and Jacobsthal–Lucas numbers are some of the most studied special integer sequences related to the Fibonacci numbers. In this study, we introduce one parameter generalizations of Jacobsthal numbers and Jacobsthal–Lucas numbers.
Bród Dorota, Michalski Adrian
doaj   +1 more source

Alternating sums of the powers of Fibonacci and Lucas numbers [PDF]

Miskolc Mathematical Notes, 2011
We shall consider alternating Melham's sums for Fibonacci and Lucas numbers of the form Sigma(n)(k=1) (-1)(k) F-2k+delta(2m+epsilon) and Sigma(n)(k=1) (-1)(k) L-2k+delta(2m+epsilon), where epsilon, delta is an element of {0, 1}.
Ömür, Neşe, Ulutaş, Yücel Türker, Kılıç, Emrah   +2 more
openaire   +3 more sources

SOME CONNECTIONS BETWEEN THE SMARANDACHE FUNCTION AND THE FIBONACCI SEQUENCE [PDF]

, 2013
This paper is aimed to provide generalizations of the Smarandache function. They will be constructed by means of sequences more general than the sequence of the factorials.
Dunutrescu, C., Rocsoreanu, C.
core   +1 more source

On the bicomplex Gaussian Fibonacci and Gaussian Lucas numbers [PDF]

, 2022
We give the bicomplex Gaussian Fibonacci and the bicomplex Gaussian Lucas numbers and establish the generating functions and Binet’s formulas related to these numbers.
Özkan, Engin, Kuloğlu, Bahar
core   +1 more source

A fast recurrence for Fibonacci and Lucas numbers

CoRR, 2021
We derive the double recurrence $e_n = \frac{1}{2}(a_{n-1}+5b_{n-1}); f_{n} = \frac{1}{2}(a_{n-1}+b_{n-1})$ with $e_0=2;f_0=0$ for the Fibonacci numbers, leading to an extremely simple and fast implementation. Though the recurrence is probably not new, we have not been able to find a reference for it.
openaire   +2 more sources

New summation identities of hyperbolic k-Fibonacci and k-Lucas quaternions [PDF]

Notes on Number Theory and Discrete Mathematics
In this paper, we introduce a set of identities involving hyperbolic k-Fibonacci quaternions and k-Lucas quaternions. Moreover, we derive summation identities for hyperbolic k-Fibonacci and k-Lucas quaternions by utilizing established properties of k ...
A. D. Godase
doaj   +1 more source

ON THE SEQUENCES RELATED TO FIBONACCI AND LUCAS NUMBERS [PDF]

Journal of the Korean Mathematical Society, 2005
The sequences \(\{U_n\}_{n\geq 0}\) and \(\{V_n\}_{n\geq 0}\) are introduced by recurrence relations: \[ \begin{aligned} U_n &= (q- 2)(U_{n-2}- U_{n-4},\;n\geq 4,\\ V_n &= (q-2) V_{n-2}- V_{n-4},\;n\geq 4\end{aligned} \] with initial conditions \(U_0= 0\), \(U_1= 1\), \(U_2= 1\), \(U_4= q- 1\), \(V_0= 2\), \(V_1= 1\), \(V_2= q-1\), where \(q\geq 5\) is
openaire   +4 more sources

Some Identities of Fibonacci and Lucas Quaternions by Quaternion Matrices

Düzce Üniversitesi Bilim ve Teknoloji Dergisi, 2019
In this paper, we consider one of the most knownFibonacci matrix Qand the Fibonacciquaternion matrix MQFn, where Qnis the n-th Fibonacci quaternion.In particular we define some new quaternion matrices.
Bahar Demirtürk Bitim
doaj   +1 more source