Results 21 to 30 of about 1,634,732 (135)
The Complex‐Type k‐Pell Numbers and Their Applications
In this study, a new sequence called the complex‐type k‐Pell number is defined. Also, we give properties of this sequence such as the generating matrix, the generating function, the combinatorial representations, the exponential representation, the sums, the permanental and determinantal representations, and the Binet formula.
Yeşim Aküzüm, Xiaogang Liu
wiley +1 more source
The arrowhead-Jacobsthal sequence
In the present investigation, we define the arrowhead-Jacobsthal sequence by the arrowhead matrix defined with the help of the characteristic polynomial of the generalized order-k Jacobsthal numbers. Next, we derive various properties of the arrowhead-Jacobsthal sequence by using its generating matrix.
Yesım Akuzum, Omur Deveci
openaire +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. The solutions rely basically on Matveev’s theorem on linear forms in logarithms of algebraic numbers and a procedure of reducing the upper bound due to Dujella
Ahmed Gaber +2 more
wiley +1 more source
On the properties of Generalized Jacobsthal and Generalized Jacobsthal-Lucas sequences
In this paper, we study the Generalized Jacobsthal and Generalized Jacobsthal-Lucas sequences. We also present some properties on relationship between the Generalized Jacobsthal sequence and Generalized Jacobsthal-Lucas sequence by using Binet’s formula for derivation.
Sukanya Somprom +2 more
openaire +1 more source
Coprime mappings and lonely runners
Abstract For x real, let {x}$ \lbrace x \rbrace$ be the fractional part of x (that is, {x}=x−⌊x⌋$\lbrace x\rbrace = x - \lfloor x \rfloor$). The lonely runner conjecture can be stated as follows: for any n positive integers v1
Tom Bohman, Fei Peng
wiley +1 more source
We use a new method of matrix decomposition for r‐circulant matrix to get the determinants of An = Circr(F1, F2, …, Fn) and Bn = Circr(L1, L2, …, Ln), where Fn is the Fibonacci numbers and Ln is the Lucas numbers. Based on these determinants and the nonsingular conditions, inverse matrices are derived.
Jiangming Ma +3 more
wiley +1 more source
On some combinatorial properties of generalized commutative Jacobsthal quaternions and generalized commutative Jacobsthal-Lucas quaternions [PDF]
summary:We study generalized commutative Jacobsthal quaternions and generalized commutative Jacobsthal-Lucas quaternions. We present some properties of these quaternions and the relations between the generalized commutative Jacobsthal quaternions and ...
Bród, Dorota +2 more
core +1 more source
Catalan Transform of k‐Balancing Sequences
In this work, the Catalan transformation (CT) of k‐balancing sequences, Bk,nn≥0, is introduced. Furthermore, the obtained Catalan transformation CBk,nn≥0 was shown as the product of lower triangular matrices called Catalan matrices and the matrix of k‐balancing sequences, Bk,nn≥0, which is an n × 1 matrix.
Asim Patra +2 more
wiley +1 more source
Identities relating six members of the Fibonacci family of sequences
In this paper, we prove several identities each relating a sum of products of three terms coming from different members of the Fibonacci family of sequences with a comparable sum whose terms come from three other sequences.
R. Frontczak, T. Goy, M. Shattuck
doaj +1 more source
On fourth-order jacobsthal quaternions
In this paper, we present for the first time a sequence of quaternions of order 4 that we will call the fourth-order Jacobsthal and the fourth-order Jacobsthal-Lucas quaternions. In particular, we are interested in the generating function, Binet formula,
Gamaliel Cerda-morales
doaj +1 more source

