Results 11 to 20 of about 903 (200)
A Context-Free Grammar Associated with Fibonacci and Lucas Sequences
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 +3 more sources
Bi-Periodic (p,q)-Fibonacci and Bi-Periodic (p,q)-Lucas Sequences [PDF]
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
Equations with Solution in Terms of Fibonacci and Lucas Sequences [PDF]
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
Elliptic Solutions of Dynamical Lucas Sequences [PDF]
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
Fibonacci and k Lucas Sequences as Series of Fractions [PDF]
In this paper, we defined new relationship between k Fibonacci and k Lucas sequences using continued fractions and series of fractions, this approach is different and never tried in k Fibonacci sequence literature.
A. D. Godase, M. B. Dhakne
openaire +2 more sources
Some identities for generalized Fibonacci and Lucas sequences [PDF]
In this study, we define a generalization of Lucas sequence {pn}. Then we obtain Binet formula of sequence {pn}. Also, we investigate relationships between generalized Fibonacci and Lucas sequences. © 2013, Hacettepe University. All rights reserved.
IRMAK, Nurettin, ALP, Murat
core +8 more sources
On some new results for the generalised Lucas sequences
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
On Fibonacci and Lucas sequences modulo a prime and primality testing
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 +2 more
doaj +3 more sources
Relations between Generalized Bi-Periodic Fibonacci and Lucas Sequences
In this paper we consider a generalized bi-periodic Fibonacci {fn} and a generalized bi-periodic Lucas sequence {qn} which are respectively defined by f0=0, f1=1, fn=afn−1+cfn−2 (n is even) or fn=bfn−1+cfn−2 (n is odd), and q0=2d, q1=ad, qn=bqn−1+cqn−2 ...
Younseok Choo
doaj +3 more sources
Generalizations of Fibonacci and Lucas sequences [PDF]
The author studies the Hecke group \(H(\sqrt q)\) (\(q\) a prime \(\geq 5\)), the subgroup of \(\text{PSL}(2, \mathbb{Z})\) generated by \(z \to {- {1/z}}\) and \(z \to {z + \sqrt q}\). This group can also be generated by \(z \to {- {1/z}}\) and an element \(S\) whose matrix representation is \[ \left(\begin{matrix} 0 & {-1} \\ 1 & {\sqrt q} \end ...
Yilmaz Özgür, Nihal
openaire +6 more sources

