Results 21 to 30 of about 145,594 (304)
Encryption and Decryption of the Data by Using the Terms of the Lucas Series
The sequence, whose initial condition is 2 and 1, obtained by summing the two terms preceding it, is called the Lucas sequence. The terms of this series continue as 2, 1, 3, 4, 7, 11, 18, 29, ... respectively. The features of the Lucas sequence have been
Mehmet Duman, Merve Güney Duman
doaj +1 more source
On the discriminator of Lucas sequences [PDF]
We consider the family of Lucas sequences uniquely determined by $U_{n+2}(k)=(4k+2)U_{n+1}(k) -U_n(k),$ with initial values $U_0(k)=0$ and $U_1(k)=1$ and $k\ge 1$ an arbitrary integer. For any integer $n\ge 1$ the discriminator function $\mathcal{D}_k(n)$ of $U_n(k)$ is defined as the smallest integer $m$ such that $U_0(k),U_1(k),\ldots,U_{n-1}(k)$ are
Bernadette Faye+5 more
openaire +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 is given by elliptic numbers. The second type involves a non-commutative version of Lucas sequences
Schlosser, Michael J., Yoo, Meesue
openaire +8 more sources
On Generalized Jacobsthal and Jacobsthal–Lucas Numbers
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
A Note on Two Fundamental Recursive Sequences
In this note, we establish some general results for two fundamental recursive sequences that are the basis of many well-known recursive sequences, as the Fibonacci sequence, Lucas sequence, Pell sequence, Pell-Lucas sequence, etc.
Farhadian Reza, Jakimczuk Rafael
doaj +1 more source
Additional Fibonacci-Bernoulli relations
We continue our study on relationships between Fibonacci (Lucas) numbers and Bernoulli numbers and polynomials. The derivations of our results are based on functional equations for the respective generating functions, which in our case are combinations ...
K. Adegoke, R. Frontczak, T.P. Goy
doaj +1 more source
On Matrix Sequence of modified Tribonacci-Lucas Numbers
In this paper, we define modified Tribonacci-Lucas matrix sequence and investigate its properties.
Erkan Taşdemir+2 more
doaj +1 more source
ON PERFECT POWERS IN LUCAS SEQUENCES [PDF]
Let (un)n≥0be the binary recurrence sequence of integers given by u0= 0, u1= 1 and un+2= 2(un+1+ un). We show that the only positive perfect powers in this sequence are u1= 1 and u4= 16. We further discuss the problem of determining perfect powers in Lucas sequences in general.
Bugeaud, Yann+3 more
openaire +3 more sources
Oscillatory Nonautonomous Lucas Sequences [PDF]
The oscillatory behavior of the solutions of the second‐order linear nonautonomous equation x(n + 1) = a(n)x(n) − b(n)x(n − 1), n ∈ ℕ0, where a, b : ℕ0 → ℝ, is studied. Under the assumption that the sequence b(n) dominates somehow a(n), the amplitude of the oscillations and the asymptotic behavior of its solutions are also analized.
Ferreira, José M., Pinelas, Sandra
openaire +3 more sources
Horadam introduced a generalized sequence of numbers, describing its key features and the special sub-sequences obtained from specific choices of initial parameters. This sequence and its sub-sequences are known as the Horadam, generalized Fibonacci, and generalized Lucas numbers, respectively.
openaire +2 more sources