Results 41 to 50 of about 242,259 (303)
Binomial Coefficients and Lucas Sequences
Journal of Number Theory, 2002 Let sequences \(\{u_n\}_{n\geq 0}\) and \(\{v_n\}_{n\geq 0}\) be defined by \(u_n= \frac{a^n-b^n}{a-b}\), \(v_n= a^n+b^n\) where \(a,b\) are integers such that \(a>|b|\). (Such sequences are Lucas sequences such that the associated quadratic polynomial has integer roots.
Florian Luca, Achim Flammenkamp
openaire +3 more sources
On the Monoid Generated by a Lucas Sequence [PDF]
, 2017 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.
Clemens Heuberger, Stephan Wagner
openaire +4 more sources
Balancing and Lucas-Balancing Numbers and their Application to Cryptography [PDF]
, 2016 It is well known that, a recursive relation for the sequence  is an equation that relates  to certain of its preceding terms .
Kumar Ray, Prasanta +2 more
core +4 more sources
The Square Terms in Lucas Sequences
Journal of Number Theory, 1996 Let \(P\) and \(Q\) be relatively prime odd integers and define the sequences \(\{U_n\}\) and \(\{V_n\}\) by \(U_n = PU_{n - 1} - QU_{n - 2}\) with \(U_0 = 0\), \(U_1 = 1\) and \(V_n = PV_{n - 1} - QV_{n - 2}\) with \(V_0 = 2\), \(V_1 = P\). The main results of the paper are the following. (i) If \(V_n\) is a square, then \(n = 1,3\) or 5.
Paulo Ribenboim +3 more
openaire +2 more sources
Some Polynomial Sequence Relations
Mathematics, 2019 We give some polynomial sequence relations that are generalizations of the Sury-type identities. We provide two proofs, one based on an elementary identity and the other using the method of generating functions.
Chan-Liang Chung
doaj +1 more source
Mersenne-Horadam identities using generating functions
Karpatsʹkì Matematičnì Publìkacìï, 2020 The main object of the present paper is to reveal connections between Mersenne numbers $M_n=2^n-1$ and generalized Fibonacci (i.e., Horadam) numbers $w_n$ defined by a second order linear recurrence $w_n=pw_{n-1}+qw_{n-2}$, $n\geq 2$, with $w_0=a$ and ...
R. Frontczak, T.P. Goy
doaj +1 more source
Practical numbers in Lucas sequences [PDF]
Quaestiones Mathematicae, 2018 A practical number is a positive integer n such that all the positive integers m ≤ n can be written as a sum of distinct divisors of n. Let (un)n≥0 be the Lucas sequence satisfying u0 = 0, u1 = 1, and un+2 = aun+1 + bun for all integers n ≥ 0, where a and b are fixed nonzero integers. Assume a(b + 1) even and a 2 + 4b > 0.
openaire +3 more sources
Some properties of the generalized (p,q)- Fibonacci-Like number
MATEC Web of Conferences, 2018 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
On Bicomplex Jacobsthal-Lucas Numbers
Journal of Mathematical Sciences and Modelling, 2020 In this study we introduced a sequence of bicomplex numbers whose coefficients are chosen from the sequence of Jacobsthal-Lucas numbers. We also present some identities about the known some fundamental identities such as the Cassini's, Catalan's and ...
Serpil Halıcı
doaj +1 more source
On $k$-Fibonacci balancing and $k$-Fibonacci Lucas-balancing numbers
Karpatsʹkì Matematičnì Publìkacìï, 2021 The balancing number $n$ and the balancer $r$ are solution of the Diophantine equation $$1+2+\cdots+(n-1) = (n+1)+(n+2)+\cdots+(n+r). $$ It is well known that if $n$ is balancing number, then $8n^2 + 1$ is a perfect square and its positive square root is
S.E. Rihane
doaj +1 more source