Results 31 to 40 of about 47,656 (155)
Combinatorial sums associated with balancing and Lucas-balancing polynomials [PDF]
The aim of the paper is to use some identities involving binomial coefficients to derive new combinatorial identities for balancing and Lucas-balancing polynomials.
Frontczak, Robert, Goy, Taras
core +4 more sources
Exact divisibility by powers of the integers in the Lucas sequence of the first kind
Lucas sequence of the first kind is an integer sequence $(U_n)_{n\geq0}$ which depends on parameters $a,b\in\mathbb{Z}$ and is defined by the recurrence relation $U_0=0$, $U_1=1$, and $U_n=aU_{n-1}+bU_{n-2}$ for $n\geq2$. In this article, we obtain exact
Kritkhajohn Onphaeng+1 more
doaj +1 more source
Fascinating Number Sequences from Fourth Order Difference Equation Via Quaternion Algebras
The balancing and Lucas-balancing numbers are solutions of second order recurrence relations. A linear combination of these numbers can also be obtained as solutions of a fourth order recurrence relation.
Patra Asim
doaj +1 more source
Solutions of the Diophantine Equations Br=Js+Jt and Cr=Js+Jt
Let Brr≥0, Jrr≥0, and Crr≥0 be the balancing, Jacobsthal, and Lucas balancing numbers, respectively. In this paper, the diophantine equations Br=Js+Jt and Cr=Js+Jt are completely solved.
Ahmed Gaber, Mohiedeen Ahmed
doaj +1 more source
On Balancing Quaternions and Lucas-Balancing Quaternions
In this paper we define and study balancing quaternions and Lucas-balancing quaternions. We give the generating functions, matrix generators and Binet formulas for these numbers. Moreover, the well-known properties e.g. Catalan, d’ Ocagne identities have
Bród Dorota
doaj +1 more source
In this paper, closed forms of the sum formulas $\sum_{k=0}^{n}x^{k}W_{mk+j}^{2}$ for generalized balancing numbers are presented. As special cases, we give sum formulas of balancing, modified Lucas-balancing and Lucas-balancing numbers.
Yüksel Soykan+2 more
doaj
Greatest common divisors of shifted balancing numbers
It is well known that the successive balancing numbers are relatively prime. Let for all integers a, sn(a) denotes the greatest common divisor of the shifted balancing numbers of the form sn(a) = gcd(Bn a; Bn+1 6a).
Prasanta Kumar Ray
doaj +1 more source
Mersenne-Horadam identities using generating functions
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
An exponential Diophantine equation related to the difference between powers of two consecutive Balancing numbers [PDF]
In this paper, we find all solutions of the exponential Diophantine equation $B_{n+1}^x-B_n^x=B_m$ in positive integer variables $(m, n, x)$, where $B_k$ is the $k$-th term of the Balancing sequence.Comment: Comments are ...
Faye, Bernadette+3 more
core +2 more sources
Generalization of Cassini formulas for balancing and Lucas-balancing numbers
Prasanta Kumar Ray, Kaberi Parida
openalex +2 more sources