Results 11 to 20 of about 613 (205)

Equations with Solution in Terms of Fibonacci and Lucas Sequences [PDF]

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2014
The main results characterize the equations (2.1) and (2.10) whose solutions are linear combinations with rational coefficients of at most two terms of classical Fibonacci and Lucas sequences.
Andreescu Titu, Andrica Dorin
doaj   +4 more sources

On Fibonacci and Lucas sequences modulo a prime and primality testing

open access: yesArab Journal of Mathematical Sciences, 2018
We prove two properties regarding the Fibonacci and Lucas Sequences modulo a prime and use these to generalize the well-known property p∣Fp−p5. We then discuss these results in the context of primality testing.
Dorin Andrica, Fawzi Al-Thukair
exaly   +6 more sources

Elliptic Solutions of Dynamical Lucas Sequences [PDF]

open access: yesEntropy, 2021
We study two types of dynamical extensions of Lucas sequences and give elliptic solutions for them. The first type concerns a level-dependent (or discrete time-dependent) version involving commuting variables. We show that a nice solution for this system
Michael J. Schlosser, Meesue Yoo
doaj   +2 more sources

Bi-Periodic (p,q)-Fibonacci and Bi-Periodic (p,q)-Lucas Sequences

open access: yesSakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 2023
In this paper, we define bi-periodic (p,q)-Fibonacci and bi-periodic (p,q)-Lucas sequences, which generalize Fibonacci type, Lucas type, bi-periodic Fibonacci type and bi-periodic Lucas type sequences, using recurrence relations of (p,q)-Fibonacci and (p,
Yasemin Taşyurdu   +1 more
doaj   +2 more sources

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

open access: yesJournal 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
Nihal Özgur
exaly   +5 more sources

On some new results for the generalised Lucas sequences

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021
In this paper we introduce the functions which count the number of generalized Lucas and Pell-Lucas sequence terms not exceeding a given value x and, under certain conditions, we derive exact formulae (Theorems 3 and 4) and establish asymptotic limits ...
Andrica Dorin   +2 more
doaj   +2 more sources

The eccentricity sequences of Fibonacci and Lucas cubes

open access: yesDiscrete Mathematics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michel Mollard
exaly   +3 more sources

A Context-Free Grammar Associated with Fibonacci and Lucas Sequences

open access: yesJournal of Mathematics, 2023
We introduce a context-free grammar G=s⟶s+d,d⟶s to generate Fibonacci and Lucas sequences. By applying the grammar G, we give a grammatical proof of the Binet formula.
Harold Ruilong Yang
doaj   +2 more sources

A note on the bi-periodic Fibonacci and Lucas matrix sequences [PDF]

open access: yesApplied Mathematics and Computation, 2018
Abstract In this paper, we introduce the bi-periodic Lucas matrix sequence and present some fundamental properties of this generalized matrix sequence. Moreover, we investigate the important relationships between the bi-periodic Fibonacci and Lucas matrix sequences. We express that some behaviors of bi-periodic Lucas numbers also can be obtained by
Arzu Coşkun
exaly   +2 more sources

The degree sequence of Fibonacci and Lucas cubes

open access: yesDiscrete Mathematics, 2011
The Fibonacci cube $\Gamma_n$ is the subgraph of the $n$-cube induced by the binary strings that contain no two consecutive 1's. The Lucas cube $\Lambda_n$ is obtained from $\Gamma_n$ by removing vertices that start and end with 1. It is proved that the number of vertices of degree $k$ in $\Gamma_n$ and $\Lambda_n$ is $\sum_{i = 0}^k \binom{n-2i}{k-i} \
Sandi Klavžar   +2 more
exaly   +4 more sources

Home - About - Disclaimer - Privacy