Results 21 to 30 of about 2,231,198 (301)
Repdigits as difference of two Fibonacci or Lucas numbers
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
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
Diophantine equations with Lucas and Fibonacci number coefficients [PDF]
Fibonacci and Lucas numbers are special number sequences that have been the subject of many studies throughout history due to the relations they provide.
Cemil Karaçam +3 more
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
Coincidences in Generalized Lucas Sequences
For an integer $k\geq 2$, let $(L_{n}^{(k)})_{n}$ be the $k-$generalized Lucas sequence which starts with $0,\ldots,0,2,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. In this paper, we find all the integers that appear in different generalized Lucas sequences; i.e., we study the Diophantine equation $L_n^{(k)}=L_m^{(\ell)
Bravo, Eric F. +2 more
openaire +2 more sources
On the Monoid Generated by a Lucas Sequence [PDF]
A Lucas sequence is a sequence of the general form $v_n = (ϕ^n - \barϕ^n)/(ϕ-\barϕ)$, where $ϕ$ and $\barϕ$ are real algebraic integers such that $ϕ+\barϕ$ and $ϕ\barϕ$ are both rational. Famous examples include the Fibonacci numbers, the Pell numbers, and the Mersenne numbers.
Heuberger, Clemens, Wagner, Stephan
openaire +2 more sources
An analysis for chosen plaintext attack in elliptic curve cryptosystem based on second order lucas sequence [PDF]
Elliptic Curve Cryptography is a cryptography based on the algebraic structure of elliptic curves over finite fields. The security of Elliptic Curve Cryptography depends on discrete logarithms that is much more difficult to challenge at equivalent key ...
Naning @ Zin, Fatin Hana +4 more
core +2 more sources
Almost repdigits in balancing and Lucas-balancing sequences [PDF]
In this paper, we define the notion of almost repdigit as a positive integer whose digits are all equal except for at most one digit, and we search all terms of the balancing and Lucas-balancing sequences which are almost repdigits.
Manasi K. Sahukar, Hussain Basha
doaj +1 more source
Aperiodic Diffractive Lenses Based on Lucas and Pell–Lucas Sequences for Controlled Multifocal Optical Fields [PDF]
. In this work, two families of sequence-based diffractive lenses are presented and comparatively analyzed: Lucas diffractive lenses and Pell– Lucas diffractive lenses.
Furlan Walter D. +4 more
doaj +1 more source
Some properties of the generalized (p,q)- Fibonacci-Like number
For the real world problems, we use some knowledge for explain or solving them. For example, some mathematicians study the basic concept of the generalized Fibonacci sequence and Lucas sequence which are the (p,q) – Fibonacci sequence and the (p,q ...
Suvarnamani Alongkot
doaj +1 more source

