Next Article in Journal
Dual Mode Symmetrical Proportional Resonant Controlled Quadratic Boost Converter for PMSM-Drive
Previous Article in Journal
Weak Deflection Angle, Hawking Radiation and Greybody Bound of Reissner–Nordström Black Hole Corrected by Bounce Parameter
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Ordered Leonardo Quadruple Numbers

by
Semra Kaya Nurkan
1,* and
İlkay Arslan Güven
2
1
Department of Mathematics, Faculty of Arts and Science, Usak University, TR-64200 Uşak, Turkey
2
Department of Mathematics, Faculty of Arts and Science, Gaziantep University, TR-27310 Gaziantep, Turkey
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(1), 149; https://doi.org/10.3390/sym15010149
Submission received: 7 December 2022 / Revised: 27 December 2022 / Accepted: 29 December 2022 / Published: 4 January 2023
(This article belongs to the Section Mathematics)

Abstract

:
In this paper, we introduce a new quadruple number sequence by means of Leonardo numbers, which we call ordered Leonardo quadruple numbers. We determine the properties of ordered Leonardo quadruple numbers including relations with Leonardo, Fibonacci, and Lucas numbers. Symmetric and antisymmetric properties of Fibonacci numbers are used in the proofs. We attain some well-known identities, the Binet formula, and a generating function for these numbers. Finally, we provide illustrations of the identities.

1. Introduction

Two attractive subjects in integer sequences are Fibonacci and Lucas sequences. Mathematicians have studied them for a long time and continue to be attracted by their broad applications. Fibonacci numbers were discovered by Italian mathematician Leonardo Fibonacci in 1202. One of his books was Liber Abaci, which focused on elementary algebra and arithmetic. This book includes many ordinary problems, such as the famous rabbit problem (see [1]). A table was created for this problem, and the numbers 1, 1, 2, 3, 5,… in the bottom row of the table are called Fibonacci numbers. Moreover, the Fibonacci sequence is constituted by these numbers. Francois Edouard Anatole Lucas named this sequence in 1876, and although Fibonacci had several mathematical contributions, he is known for this sequence above all. The Fibonacci numbers arise throughout nature, for example, in flowers, trees, sunflowers, pinecones, artichokes, and pineapples. The number of petals in many flowers is often a Fibonacci number. The pentagonal shape with five pods is disclosed in the cross section of an apple. The Fibonacci number is also exhibited in a starfish, which has five limbs. Some spiral systems of leaves on the twigs of plants and trees hold Fibonacci numbers. Ripe sunflowers present Fibonacci numbers in a salient way, as the number of seeds from the center of the head to the exterior edge are wrapped in two different spirals in a clockwise and counterclockwise direction. With some exceptions, the number of spirals follows Fibonacci numbers. The spiral patterns on pineapples, pinecones, and artichokes are Fibonacci number examples. As can be seen, we encounter these numbers in numerous places. One other example is concerned with the Earth. The equatorial diameter of the Earth in miles and in kilometers is approximately the product of two alternate Fibonacci numbers and consecutive Fibonacci numbers, respectively (see [1]).
On the other hand, there is a relation between the golden ratio and Fibonacci numbers. The irrational number 1 + 5 2 , which has the value 1.61803…, is defined as the golden ratio, and it is observed in many areas in mathematics and art. The relationship between the golden ratio and Fibonacci numbers is that as n increases in the ratio of successive Fibonacci numbers F n F n 1 , the result approaches the golden ratio.
The Fibonacci sequence comprises the numbers
1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , 34 , 55 , 89 , 144 , . . .
The n-th Fibonacci number F n has the recursive definition as
F n = F n 1 + F n 2 , n 3 ,
with the initial conditions F 1 = F 2 = 1 .
Lucas numbers are intimately related to Fibonacci numbers and were discovered by Francois Edouard Anatole Lucas in the late nineteenth century. The numbers of the Lucas sequence are
2 , 1 , 3 , 4 , 7 , 11 , 18 , 29 , 47 , 76 , 123 , . . . ,
with the initial conditions L 0 = 2 and L 1 = 1 . The n-th Lucas number is indicated by L n and satisfies the same recurrence relation of Fibonacci numbers. There are many relationships between Fibonacci and Lucas numbers, which can be seen in [1,2,3].
Falcon and Plaza generalized Fibonacci numbers and called them k-Fibonacci numbers in [4]. These numbers are connected with complex valued fuctions, and they give a generalization of the Pell sequence and Fibonacci sequence. After this study, mathematicians worked on this issue in [5,6]. Then, generalized Fibonacci numbers and k-Fibonacci numbers were studied with matrices in [7,8,9,10,11]. The descriptions and several properties of these matrices were given.
In more recent times, Catarino and Borges defined a new type of number related to Fibonacci numbers, called Leonardo numbers, in [12]. They proved some properties comprising this new sequence. Some sum and product statements, including elements of this sequence, were presented. New identities of Leonardo numbers were obtained by Alp and Koçer in [13]. The same authors identified hybrid Leonardo numbers and found well-known properties for them in [14]. Additionally, Leonardo numbers were generalized by Shannon in [15], and using the Leonardo Pisano numbers and hybrid numbers, Kürüz et al. investigated Leonardo Pisano polynomials and hybrinomials [16].
Quaternions are a four dimensional number system, invented as an extension of complex numbers by Irish mathematician W. R. Hamilton in 1843 [17]. Quaternions are noncommutative with multiplication operations; in addition, they are associative and constitute a group recognized as a quaternion group. Quaternions correspond to rotation in three dimensional space, are used in vectorial studies, and help to interpret some physical equations and spherical geometry. Especially in recent years, the utilization of quaternions has broadened, including geometry, physics, mechanics, kinematics, vectorial analysis, animation, computer graphics, and the technology of robots.
Many types of quaternions, just as dual quaternions, split quaternions, bi-quaternions, hyperbolic quaternions, segre quaternions, ellipsoidal quaternions, hyperboloidal quaternions, degenerate quaternions, degenerate pseudo quaternions, null quaternions, and generalized quaternions have been studied by researchers. Split quaternions were introduced firstly by Cockle [18] in 1849. Bi-quaternions were given by Clifford in [19]. Quaternions of Fibonacci type and generalized Fibonacci quaternions were investigated in [20,21,22]. Kula and Yaylı studied split quaternions in semi-Euclidean space E 2 4 in [23]. Moreover, split Fibonacci quaternions and their properties were given by Akyiğit et al. in [24]. Dual quaternions with real number coefficients were defined by Majernik in [25]. Additionally, Majernik expressed the special Galilean transformation in the algebraic ring of the dual four-component numbers in [26]. Nurkan and Güven identified dual Fibonacci and Lucas quaternions with dual number coefficients in [27]. After that, from a different viewpoint, Yüce and Aydın gave dual Fibonacci and Lucas quaternions with real number coefficients in [28]. In addition, quaternion-like structures have been a popular topic of study in recent years. Özdemir defined a new noncommutative number system called hybrid numbers in [29]. Kızılateş and Kone dealt with developing a new class of quaternions, octonions, and sedenions called higher order Fibonacci 2 m -ions (or-higher order Fibonacci hyper complex numbers) whose components were higher order Fibonacci numbers in [30]. Gu discussed algebraic equations and obtained some interesting relations by means of hypercomplex numbers in [31].
To summarize, number systems play a special role in defining different types of quaternions. Combining the fundamental properties of numbers and quaternions enables the determination of new features. Considering the numbers mentioned above, the quaternions with different number components have been studied by several authors from many points of view.
Motivated by these ideas, in this work, we combined Leonardo numbers and dual quaternions. Since dual quaternions are a four dimensional number system, we were inspired by dual quaternions, and we called these new numbers “ordered Leonardo quadruple numbers”, which are ordered quadruple numbers with Leonardo number components. We imputed the properties of ordered Leonardo quadruple numbers and established some relations between quadruple numbers and Leonardo numbers. Additionally, special identities, which are Cassini identities, and Binet’s formula were obtained. Moreover, a generating function for these quadruple numbers was given. Finally, we illustrated the identities with examples.

2. Preliminaries

In this part, some basic terms are recollected in relation to dual quaternions and Leonardo numbers.
In [12], the authors stated that Leonardo numbers are terms of the Leonardo sequence, which is expressed as L e n n = 0 . The n-th Leonardo number is denoted by L e n . The following recurrence relation
L e n = L e n 1 + L e n 2 + 1 , n 2
defines this sequence, and L e 0 = L e 1 = 1 are the initial conditions. The Leonardo numbers of the Leonardo sequence are
1 , 1 , 3 , 5 , 9 , 15 , 25 , 41 , 67 , 109 , 177 , 287 , 465 , . . .
In deference to the n-th Fibonacci number F n , the relation between Fibonacci numbers and Leonardo numbers is given by
L e n = 2 F n + 1 1 ,
for n 0 .
Quaternions are a four dimensional number system discovered by W. R. Hamilton in 1843 and are given as the elements of the set [17]
H = q = q 0 + i q 1 + j q 2 + k q 3 q 0 , q 1 , q 2 , q 3 R ,
where i, j, and k are the standard orthonormal basis in R 3 and
i 2 = j 2 = k 2 = 1 , i j = j i = k , j k = k j = i , k i = i k = j .
A dual quaternion, as an extension of a dual number in four dimensions, is defined by the same form with different multiplication conditions for quaternionic units as in [25]
i 2 = j 2 = k 2 = i j k = 0 , i j = j i = j k = k j = k i = i k = 0 .
The set of dual quaternions
H D = q = a + i b + j c + k d a , b , c , d R ,
which is isomorphic to Galilean 4-space, forms a commutative division algebra under addition and multiplication. Furthermore, using the dual quaternions, one can express the Galilean transformation in one quaternionic equation [25].

3. Ordered Leonardo Quadruple Numbers

In this part, by inspiring dual quaternions and Leonardo numbers, ordered Leonardo quadruple numbers are given. We define an ordered Leonardo quadruple number set as
Q L = Q n Q n = L e n + i L e n + 1 + j L e n + 2 + k L e n + 3 a n d L e n , n - th L e o n a r d o n u m b e r ,
where
i 2 = j 2 = k 2 = i j k = 0 , i j = j i = j k = k j = k i = i k = 0 .
Note that throughout this paper, we denote the n-th ordered Leonardo quadruple number with Q n .
Lemma 1. 
Let the set A = L e n , L e n + 1 , L e n + 2 , L e n + 3 L e n L e n n = 0 be a set containing ordered quadruple numbers. The function F : A Q L given as
F ( L e n , L e n + 1 , L e n + 2 , L e n + 3 ) = L e n + i L e n + 1 + j L e n + 2 + k L e n + 3
is an isomorphism.
Proof. 
Formally, an isomorphism is a bijective morphism. In other words, the term isomorphism is mainly used for algebraic structures. In this case, mappings are called homomorphisms, and a homomorphism is an isomorphism if and only if it is bijective. It can be easily seen that the function F is bijective. So F is an isomorphism, and the ordered quadruple number set A and ordered Leonardo quadruple number set Q L are isomorphic. □
Remark 1. 
The n-th ordered Leonardo quadruple number Q n = L e n + i L e n + 1 + j L e n + 2 + k L e n + 3 can be represented as the quadruple number Q n = ( L e n , L e n + 1 , L e n + 2 , L e n + 3 ) .
Let us take two ordered Leonardo quadruple numbers from Q L as follows:
Q n = L e n + i L e n + 1 + j L e n + 2 + k L e n + 3
and
Q m = L e m + i L e m + 1 + j L e m + 2 + k L e m + 3 .
The addition and subtraction operations of the ordered Leonardo quadruple numbers are defined by
Q n ± Q m = ( L e n ± L e m ) + i L e n + 1 ± L e m + 1 + j L e n + 2 ± L e m + 2 + k L e n + 3 ± L e m + 3 .
Multiplication of two ordered Leonardo quadruple numbers is defined by
Q n Q m = ( L e n L e m ) + i L e n L e m + 1 + L e n + 1 L e m + j L e n L e m + 2 + L e n + 2 L e m + k L e n L e m + 3 + L e n + 3 L e m .
The scalar and vector part of the n-th term Q n of the ordered Leonardo quadruple number sequence are given as
S Q n = L e n and V Q n = i L e n + 1 + j L e n + 2 + k L e n + 3 .
So, Q n can be given as Q n = S Q n + V Q n , and the multiplication in Equation (6) is denoted by
Q n Q m = S Q n S Q m + S Q n V Q m + S Q m V Q n .
Moreover, it can easily be seen that V Q n × V Q m = 0 .
The conjugate of Q n is given by
Q n ¯ = L e n i L e n + 1 j L e n + 2 k L e n + 3 ,
and the norm of Q n is given by
N Q n = Q n = Q n Q n ¯ = L e n 2 .
Now, we state the following theorems including the properties of ordered Leonardo quadruple numbers.
Remark 2. 
The ordered quadruple Q = 1 + i + j + k will be represented in this paper as "Q".
Theorem 1. 
Let the n-th terms of the Leonardo sequence L e n and ordered Leonardo quadruple number sequence Q n be L e n and Q n , respectively. For n 0 and m 1 , the following equations hold:
Q n + Q n + 1 + Q = Q n + 2
Q n i Q n + 1 j Q n + 2 k Q n + 3 = L e n
Q n Q m + Q n + 1 Q m + 1 = 2 ( 2 Q n + m + 2 + 1 ) Q n + 2 Q m + 2 2 L e n + m + 2 ( i + j + k ) ( L e n + 2 + L e m + 2 4 ) .
Proof. 
(10): By using the n-th and ( n + 1 ) t h terms in Equations (3) and (1), we have
Q n + Q n + 1 = ( L e n + 2 1 ) + i ( L e n + 3 1 ) + j ( L e n + 4 1 ) + k ( L e n + 5 1 ) = L e n + 2 + i L e n + 3 + j L e n + 4 + k L e n + 5 ( 1 + i + j + k ) = Q n + 2 Q .
(11): By Equation (3), we directly obtain
Q n i Q n + 1 j Q n + 2 k Q n + 3 = L e n + i L e n + 1 + j L e n + 2 + k L e n + 3 i ( L e n + 1 + i L e n + 2 + j L e n + 3 + k L e n + 4 ) j ( L e n + 2 + i L e n + 3 + j L e n + 4 + k L e n + 5 ) k ( L e n + 3 + i L e n + 4 + j L e n + 5 + k L e n + 6 ) = L e n .
(12): By Equation (3), we first obtain
Q n Q m = L e n L e m + i ( L e n L e m + 1 + L e n + 1 L e m ) + j ( L e n L e m + 2 + L e n + 2 L e m ) + k ( L e n L e m + 3 + L e n + 3 L e m )
and
Q n + 1 Q m + 1 = L e n + 1 L e m + 1 + i ( L e n + 1 L e m + 2 + L e n + 2 L e m + 1 ) + j ( L e n + 1 L e m + 3 + L e n + 3 L e m + 1 ) + k ( L e n + 1 L e m + 4 + L e n + 4 L e m + 1 ) .
Taking into account Equations (13) and (14) and the property L e n L e m + L e n + 1 L e m + 1 = 2 ( L e n + m + 2 + 1 ) L e n + 2 L e m + 2 given in [13], we obtain
Q n Q m + Q n + 1 Q m + 1 = 4 ( L e n + m + 2 + i L e n + m + 3 + j L e n + m + 4 + k L e n + m + 5 ) 2 L e n + m + 2 + 2 + 4 i + 4 j + 4 k ( L e n + 2 + i L e n + 3 + j L e n + 4 + k L e n + 5 ) ( L e m + 2 + i L e m + 3 + j L e m + 4 + k L e m + 5 ) ( i + j + k ) L e n + 2 ( i + j + k ) L e m + 2 = 4 Q n + m + 2 2 L e n + m + 2 + 2 + 4 i + 4 j + 4 k Q n + 2 Q m + 2 ( i + j + k ) ( L e n + 2 + L e m + 2 ) = 2 ( 2 Q n + m + 2 + 1 ) Q n + 2 Q m + 2 2 L e n + m + 2 ( i + j + k ) ( L e n + 2 + L e m + 2 4 ) .
Theorem 2. 
Let the n-th terms of the dual Lucas quaternion sequence T n and ordered Leonardo quadruple number sequence Q n be T n and Q n , respectively. For Equation (15), n 1 , and for Equation (16), n 2 , the following equations hold:
Q n 1 + Q n + 1 = 2 ( T n + 1 Q )
Q n + 2 Q n 2 = 2 T n + 1 .
Proof. 
From Equation (3), the property L e n 1 + L e n + 1 = 2 L n + 1 2 given in [13], and the dual Lucas quaternion T n = L n + i L n + 1 + j L n + 2 + k L n + 3 in [28], we obtain
Q n 1 + Q n + 1 = ( L e n 1 + L e n + 1 ) + i ( L e n + L e n + 2 ) + j ( L e n + 1 + L e n + 3 ) + k ( L e n + 2 + L e n + 4 ) = 2 ( L n + 1 + i L n + 2 + j L n + 3 + k L n + 4 ) 2 2 i 2 j 2 k = 2 ( T n + 1 Q ) .
Taking m = 2 in the equation L e n + m ( 1 ) m L e n m = L n + 1 ( L e m 1 + 1 ) 1 + ( 1 ) m given in [13], we have
L e n + 2 L e n 2 = 2 L n + 1 .
By using Equations (3) and (17), we obtain
Q n + 2 Q n 2 = ( L e n + 2 L e n 2 ) + i ( L e n + 3 L e n 1 ) + j ( L e n + 4 L e n ) + k ( L e n + 5 L e n + 1 ) = 2 ( L n + 1 + i L n + 2 + j L n + 3 + k L n + 4 ) = 2 T n + 1 .
Theorem 3. 
Let the n-th term of the ordered Leonardo quadruple number sequence Q n be Q n and the conjugate of Q n be Q n ¯ . For n 1 , the following equations hold:
Q n + Q n ¯ = 2 L e n Q n 2 = 2 Q n L e n L e n 2 Q n Q n ¯ + Q n 1 Q ¯ n 1 = 2 ( 1 + L e 2 n L e n + 1 ) Q n Q n ¯ + Q n + 1 Q ¯ n + 1 = 2 ( 1 + L e 2 n + 2 L e n + 2 ) Q n + 1 Q ¯ n + 1 Q n 1 Q ¯ n 1 = 2 ( L e 2 n + 1 L e n ) Q n 2 + Q n 1 2 = 4 Q 2 n 2 Q n + 1 + Q ( 4 2 L e n + 1 ) 2 ( 1 + L e 2 n L e n + 1 ) .
Proof. 
The first four properties in Equation (18) can be easily proved by using Equations (3) and (8).
Considering Equation (9) and L e n + 1 2 L e n 1 2 = 2 ( L e 2 n + 1 L e n ) given in [13], we obtain the fifth equation as
Q n + 1 Q ¯ n + 1 Q n 1 Q ¯ n 1 = L e n + 1 2 L e n 1 2 = 2 ( L e 2 n + 1 L e n ) .
Lastly for the sixth equation, by using the second equation in (18) and Equation (3),
Q n 2 + Q n 1 2 = 2 Q n L e n L e n 2 + 2 Q n 1 L e n 1 L e n 1 2 = L e n 2 + L e n 1 2 + 2 i ( L e n L e n 1 + L e n + 1 L e n ) + 2 j ( L e n 1 L e n + 1 + L e n L e n + 2 ) + 2 k ( L e n 1 L e n + 2 + L e n L e n + 3 ) .
Here, by using L e n + 1 2 + L e n 2 = 2 ( L e 2 n + 2 L e n + 2 + 1 ) and L e n L e m + L e n + 1 L e m + 1 = 2 ( L e n + m + 2 + 1 ) L e n + 2 L e m + 2 given in [13], we have the result
Q n 2 + Q n 1 2 = 2 ( L e 2 n L e n + 1 + 1 ) + 2 i ( 2 ( L e 2 n + 1 + 1 ) L e n + 1 L e n + 2 ) + 2 j ( 2 ( L e 2 n + 2 + 1 ) L e n + 1 L e n + 3 ) + 2 k ( 2 ( L e 2 n + 3 + 1 ) L e n + 1 L e n + 4 ) + 2 L e 2 n 2 L e 2 n = 4 ( L e 2 n + i L e 2 n + 1 + j L e 2 n + 2 + k L e 2 n + 3 ) + 4 ( 1 + i + j + k ) 2 ( L e n + 1 + i L e n + 2 + j L e n + 3 + k L e n + 4 ) 2 L e n + 1 ( 1 + i + j + k ) 2 2 L e 2 n + 2 L e n + 1 = 4 Q 2 n 2 Q n + 1 + ( 1 + i + j + k ) ( 4 2 L e n + 1 ) 2 ( 1 + L e 2 n L e n + 1 ) .
Theorem 4. 
Let the n-th term of the ordered Leonardo quadruple number sequence Q n be Q n . Then, the following equations hold:
n s = 0 Q s = Q n + 2 ( n + 2 ) Q ( 2 i + 4 j + 8 k )
n s = 0 Q 2 s = Q 2 n + 1 n Q ( 2 i + 2 j + 4 k )
n s = 0 Q 2 s + 1 = Q 2 n + 2 n Q ( 2 + 2 i + 4 j + 6 k )
p s = 0 Q n + s + Q n + 1 = Q n + p + 2 ( p + 1 ) Q .
Proof. 
(19): From Equation (3) and s = 0 n L e s = L e n + 2 ( n + 2 ) given in [12], we have
n s = 0 Q s = n s = 0 ( L e s + i L e s + 1 + j L e s + 2 + k L e s + 3 ) = n s = 0 L e s + i L e n + 1 L e 0 + n s = 0 L e s + j L e n + 2 + L e n + 1 L e 0 L e 1 + n s = 0 L e s + k L e n + 3 + L e n + 2 + L e n + 1 L e 0 L e 1 L e 2 + n s = 0 L e s = L e n + 2 ( n + 2 ) + i L e n + 1 + L e n + 2 L e 0 ( n + 2 ) j L e n + 2 + L e n + 1 L e 0 L e 1 + L e n + 2 ( n + 2 ) + k L e n + 3 + L e n + 2 + L e n + 1 L e 0 L e 1 L e 2 + L e n + 2 ( n + 2 ) .
In this stage, by Equation (1), we obtain the result simply as
n s = 0 Q s = L e n + 2 + i L e n + 3 + j L e n + 4 + k L e n + 5 ( n + 2 ) ( 1 + i + j + k ) ( i + 2 j + 3 k ) L e 0 ( i + j + k ) L e 1 ( j + k ) L e 2 k = Q n + 2 ( n + 2 ) Q ( 2 i + 4 j + 8 k ) .
(20): By using Equations (1) and (3), and the summation formulas s = 0 n L e 2 s = L e 2 n + 1 n and s = 0 n L e 2 s + 1 = L e 2 n + 2 ( n + 2 ) given in [12], we obtain
n s = 0 Q 2 s = n s = 0 L e 2 s + i n s = 0 L e 2 s + 1 + j n s = 0 L e 2 s + 1 + L e 2 s + 1 + k n s = 0 2 L e 2 s + 1 + L e 2 s + 2 = L e 2 n + 1 + i L e 2 n + 2 + j L e 2 n + 3 + k L e 2 n + 4 n i ( n + 2 ) j ( n + 2 ) k ( n + 4 ) = Q 2 n + 1 n ( 1 + i + j + k ) ( 2 i + 2 j + 4 k ) .
(21): The proof is similiar to (20).
(22): Firstly, we have
p s = 0 Q n + s = Q n + Q n + 1 + . . . + Q n + p
and
n + p r = 0 Q r n 1 r = 0 Q r = Q 0 + Q 1 + . . . + Q n + Q n + 1 + . . . Q n + p Q 0 Q 1 . . . Q n 1 = Q n + Q n + 1 + . . . + Q n + p .
By putting (24) into Equation (23), we obtain
p s = 0 Q n + s = n + p r = 0 Q r n 1 r = 0 Q r .
If we take n n 1 and n n + p in Equation (19), then
n 1 r = 0 Q r = Q n + 1 ( n + 1 ) ( 1 + i + j + k ) ( 2 i + 4 j + 8 k )
n + p r = 0 Q r = Q n + p + 2 ( n + p + 2 ) ( 1 + i + j + k ) ( 2 i + 4 j + 8 k ) .
Considering Equations (25)–(27), we find
p s = 0 Q n + s = Q n + p + 2 Q n + 1 ( p + 1 ) ( 1 + i + j + k ) .
Finally, by using Equation (28), the result is obvious. □
Theorem 5. 
(Binet’s Formula): Let the n-th term of the ordered Leonardo quadruple number sequence Q n be Q n . For n 0 , Binet’s formula is given by:
Q n = 2 α β α ̲ α n + 1 β ̲ β n + 1 Q ,
where α = 1 + 5 2 , β = 1 5 2 , α ̲ = 1 + i α + j α 2 + k α 3 , and β ̲ = 1 + i β + j β 2 + k β 3 .
Proof. 
Binet’s formula for Leonardo numbers was given in [12] as
L e n = 2 α n + 1 β n + 1 α β 1 .
By Equations (3) and (29) and making the appropriate calculations, we obtain
Q n = 2 α β ( α n + 1 ( 1 + i α + j α 2 + k α 3 ) β n + 1 ( 1 + i β + j β 2 + k β 3 ) ) 1 i j k .
If we let α ̲ = 1 + i α + j α 2 + k α 3 and β ̲ = 1 + i β + j β 2 + k β 3 in the last equation, we obtain the result.
Theorem 6. 
(Cassini Identity): Let the n-th term of the ordered Leonardo quadruple number sequence Q n be Q n . For n 1 , the Cassini identity is given by:
Q n 1 Q n + 1 Q n 2 = 4 ( 1 ) n + 1 ( 1 + i + 3 j + 4 k ) + ( 1 + i + 2 j + k ) L e n 2 + k L e n + ( j + k ) Q n 1 .
Proof. 
By using Equation (3) and arranging the calculations, we have
Q n 1 Q n + 1 Q n 2 = L e n 1 L e n + 1 L e n 2 + i ( L e n 1 L e n + 2 L e n L e n + 1 ) + j ( L e n 1 L e n + 3 L e n L e n + 2 + L e n + 1 L e n + 1 L e n + 2 L e n ) + k ( L e n 1 L e n + 4 L e n L e n + 3 + L e n + 2 L e n + 1 L e n + 3 L e n ) .
The Cassini identity and the d’Ocagnes identity for the Leonardo numbers were given in [12] as
L e n 2 L e n 1 L e n + 1 = L e n 1 L e n 2 + 4 ( 1 ) n
L e m L e n + 1 L e m + 1 L e n = 2 ( 1 ) n + 1 ( L e m n 1 + 1 ) + L e m 1 L e n 1 .
Now, we use Equation (32) and replace the following indices as follows.
For m n 1 and n n + 1 ,
L e n 1 L e n + 2 L e n L e n + 1 = 2 ( 1 ) n + 2 ( L e 3 + 1 ) + L e n 2 L e n .
For m n 1 and n n + 2 ,
L e n 1 L e n + 3 L e n L e n + 2 = 2 ( 1 ) n + 3 ( L e 4 + 1 ) + L e n 2 L e n + 1 .
For m n + 1 and n n ,
L e n + 1 L e n + 1 L e n + 2 L e n = 2 ( 1 ) n + 1 ( L e 0 + 1 ) + L e n L e n 1 .
For m n 1 and n n + 3 ,
L e n 1 L e n + 4 L e n L e n + 3 = 2 ( 1 ) n + 4 ( L e 5 + 1 ) + L e n 2 L e n + 2 .
For m n + 2 and n n ,
L e n + 2 L e n + 1 L e n + 3 L e n = 2 ( 1 ) n + 1 ( L e 1 + 1 ) + L e n + 1 L e n 1 .
Here, by using negaleonardo numbers, which are Leonardo numbers with a negative index given in [13] and by taking into account Equations (31) and (33)–(37) in Equation (30), we find
Q n 1 Q n + 1 Q n 2 = 4 ( 1 ) n + 1 ( 1 + i + 3 j + 4 k ) + ( 1 + i + j + k ) L e n 2 + j ( L e n L e n 1 ) + k ( L e n + 1 L e n 1 ) ( L e n 1 + i L e n + j L e n + 1 + k L e n + 2 ) .
Considering Equations (1) and (3) in last equation, we obtain the result as
Q n 1 Q n + 1 Q n 2 = 4 ( 1 ) n + 1 ( 1 + i + 3 j + 4 k ) + ( 1 + i + j + k ) L e n 2 + j ( L e n 2 + 1 ) + k ( L e n + 1 ) Q n 1 = 4 ( 1 ) n + 1 ( 1 + i + 3 j + 4 k ) + ( 1 + i + 2 j + k ) L e n 2 + k L e n + ( j + k ) Q n 1 .

4. Generating Function

In this part, generating functions for the ordered Leonardo quadruple number sequence are attained. To correlate every number sequence via a function, we use “generating functions”.
Let f n n = 0 be a real numbers sequence. The power series
F ( x ) = n = 0 f n x n
is called the generating function of the sequence f n n = 0 .
In [12], the generating function of the Leonardo sequence is obtained as
g L e ( t ) = 1 t + t 2 1 2 t + t 3 .
Theorem 7. 
The generating function for the ordered Leonardo quadruple number sequence Q n n = 0 is given as
g Q ( t ) = ( 1 t + t 2 ) + i ( 1 + t t 2 ) + j ( 3 t t 2 ) + k ( 5 t 3 t 2 ) 1 2 t + t 3 ,
where 1 2 t + t 3 0 .
Proof. 
First, we indicate the property
Q n = 2 Q n 1 Q n 3 .
In Equation (10), if we replace n n 1 , then we have
Q n + 1 = Q n 1 + Q n + ( 1 + i + j + k ) .
By subtracting Equation (10) from Equation (40), we obtain Q n + 2 = 2 Q n + 1 Q n 1 . If we take n as n 2 in this last equality, we find Equation (39).
Now by the help of Equation (38), the generating function for the ordered Leonardo quadruple number sequence Q n n = 0 is written by
g Q ( t ) = n = 0 Q n t n .
Let us open the sum in Equation (41) and calculate g Q ( t ) .
g Q ( t ) = Q 0 + Q 1 t + Q 2 t 2 + n = 3 Q n t n .
In this part, by using Equation (39), we have
g Q ( t ) = Q 0 + Q 1 t + Q 2 t 2 + n = 3 ( 2 Q n 1 Q n 3 ) t n = Q 0 + Q 1 t + Q 2 t 2 + 2 n = 3 Q n 1 t n n = 3 Q n 3 t n = Q 0 + Q 1 t + Q 2 t 2 + 2 t n = 3 Q n 1 t n 1 t 3 n = 3 Q n 3 t n 3 = Q 0 + Q 1 t + Q 2 t 2 + 2 t n = 2 Q n t n t 3 n = 0 Q n t n = Q 0 + Q 1 t + Q 2 t 2 + 2 t n = 2 Q n t n + Q 0 + Q 1 t Q 0 Q 1 t t 3 n = 0 Q n t n = Q 0 + Q 1 t + Q 2 t 2 2 Q 0 t 2 Q 1 t 2 + 2 t n = 0 Q n t n t 3 n = 0 Q n t n
By using Equation (41) and arranging the last equation, we find
g Q ( t ) 2 t g Q ( t ) + t 3 g Q ( t ) = Q 0 + ( Q 1 2 Q 0 ) t + ( Q 2 2 Q 1 ) t 2 .
On the other hand, we have
Q 0 = 1 + i + 3 j + 5 k
Q 1 2 Q 0 = 1 + i j k
Q 2 2 Q 1 = 1 i j 3 k .
Finally, by putting Equations (43)–(45) into Equation (42), we obtain the generating function as
g Q ( t ) = ( 1 t + t 2 ) + i ( 1 + t t 2 ) + j ( 3 t t 2 ) + k ( 5 t 3 t 2 ) 1 2 t + t 3 .
In the last part, some examples are given.
Example 1. 
1-If n = 0 and m = 1 for Equations (11) and (12), then the following expressions are calculated, and they satisfy Theorem 1:
Q 0 i Q 1 j Q 2 k Q 3 = 1 and L e 0 = 1
and
Q 0 Q 1 + Q 1 Q 2 = 4 + 18 i + 32 j + 56 k 2 ( 2 Q 3 + 1 ) Q 2 Q 3 2 L e 3 ( i + j + k ) ( L e 2 + L e 3 4 ) = 4 + 18 i + 32 j + 56 k .
2-If n = 1 and n = 2 for Equations (15) and (16) in Theorem 2, respectively, then
Q 0 + Q 2 = 4 + 6 i + 12 j + 20 k 2 ( T 2 1 i j k ) = 4 + 6 i + 12 j + 20 k
and
Q 4 Q 0 = 8 + 14 i + 22 j + 36 k 2 T 3 = 8 + 14 i + 22 j + 36 k
3-If n = 1 for Theorem 3, then the third, fourth, and fifth Equations in (18) are calculated as:
Q 1 Q 1 ¯ + Q 0 Q ¯ 0 = 2 2 ( 1 + L e 2 L e 2 ) = 2
Q 1 Q 1 ¯ + Q 2 Q ¯ 2 = 10 2 ( 1 + L e 4 L e 3 ) = 10
Q 2 Q ¯ 2 Q 0 Q ¯ 0 = 8 2 ( L e 3 L e 1 ) = 8
and if n = 2 , for the sixth equation,
Q 2 2 + Q 1 2 = 10 + 36 i + 64 j + 108 k 4 Q 4 2 Q 3 + ( 1 + i + j + k ) ( 4 2 L e 3 ) 2 ( 1 + L e 4 L e 3 ) = 10 + 36 i + 64 j + 108 k .
4-If n = 2 for Equation (20) in Theorem 4, then
2 s = 0 Q 2 s = Q 0 + Q 2 + Q 4 = 13 + 21 i + 37 j + 61 k Q 5 2 ( 1 + i + j + k ) ( 2 i + 2 j + 4 k ) = 13 + 21 i + 37 j + 61 k ,
n = 3 for Equation (21) in Theorem 4;
3 s = 0 Q 2 s + 1 = Q 1 + Q 3 + Q 5 + Q 7 = 62 + 104 i + 170 j + 278 k
Q 8 3 ( 1 + i + j + k ) ( 2 + 2 i + 4 j + 6 k ) = 62 + 104 i + 170 j + 278 k ,
and n = 2 and p = 1 for Equation (22) in Theorem 4,
1 s = 0 Q 2 + s + Q 3 = Q 2 + 2 Q 3 = 13 + 23 i + 39 j + 65 k Q 5 2 ( 1 + i + j + k ) = 13 + 23 i + 39 j + 65 k .
Example 2. 
1-If n = 1 for the Cassini identity in Theorem 6, then
Q 0 Q 2 Q 1 2 = 2 + 2 i + 8 j + 12 k
4 ( 1 ) 2 ( 1 + i + 3 j + 4 k ) + ( 1 + i + 2 j + k ) L e 1 + k L e 1 + ( j + k ) Q 0 = 2 + 2 i + 8 j + 12 k
and if n = 2 for the Cassini identity,
Q 1 Q 3 Q 2 2 = 4 6 i 14 j 20 k
4 ( 1 ) 3 ( 1 + i + 3 j + 4 k ) + ( 1 + i + 2 j + k ) L e 0 + k L e 2 + ( j + k ) Q 1 = 4 6 i 14 j 20 k .

5. Conclusions and Remarks

Inspired by the dual quaternions given in [25], we took the coefficients of the dual quaternions as Leonardo numbers. We did not call these new notions “quaternions”, because the set of numbers given as the definition in (3) was not a ring, as this set was not closed under multiplication. To not suffer the lack of closure under multiplication, we named these numbers the “ordered Leonardo quadruple numbers” in the set Q L which was isomorphic to the set of ordered quadruple numbers.
Further study and applications of ordered Leonardo quadruple numbers will include matrices and their theories. In addition, new number systems can be studied in hypercomplex numbers and quaternion-like structures, whose components are Leonardo numbers. The results presented here have the potential to motivate further research into the subject of the higher-order or generalized-ordered Leonardo quadruple numbers, which may also be worth further study.

Author Contributions

Conceptualization, S.K.N. and İ.A.G.; methodology, S.K.N. and İ.A.G.; validation, S.K.N. and İ.A.G.; formal analysis, S.K.N. and İ.A.G.; investigation, S.K.N. and İ.A.G.; resources, S.K.N. and İ.A.G.; writing-original draft preparation, İ.A.G.; writing-review and editing, S.K.N.; project administration, S.K.N. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare that they have no conflict of interest.

References

  1. Koshy, T. Fibonacci and Lucas Numbers with Applications; A Wiley-Interscience Publications: New York, NY, USA, 2001. [Google Scholar]
  2. Atanassov, K.T.; Atanassova, V.; Shannon, A.G.; Turner, J.C. New Visual Perspectives on Fibonacci Numbers; World Scientific Publishing: Singapore, 2002. [Google Scholar]
  3. Park, H.; Cho, B.; Cho, D.; Cho, Y.D.; Park, J. Representation of Integers as Sums of Fibonacci and Lucas Numbers. Symmetry 2020, 12, 1625. [Google Scholar] [CrossRef]
  4. Falcon, S.; Plaza, A. On the Fibonacci k-numbers. Chaos Solitons Fractals 2007, 32, 1615–1624. [Google Scholar] [CrossRef]
  5. Bravo, J.J.; Gomez, C.A.; Herrera, J.L. On the intersection of k-Fibonacci and Pell numbers. Bull. Korean Math. Soc. 2019, 56, 535–547. [Google Scholar]
  6. Guo, D.; Chu, W. Sums of Pell/Lucas Polynomials and Fibonacci/Lucas Numbers. Mathematics 2022, 10, 2667. [Google Scholar] [CrossRef]
  7. Borges, A.; Catarino, P.; Aires, A.P.; Vasco, P.; Campos, H. Two-by-two matrices involving k-Fibonacci and k-Lucas sequences. Appl. Math. Sci. 2014, 8, 1659–1666. [Google Scholar] [CrossRef]
  8. Candan, M. Some Characteristics of Matrix Operators on Generalized Fibonacci Weighted Difference Sequence Space. Symmetry 2022, 14, 1283. [Google Scholar] [CrossRef]
  9. Falcon, S. On the generating matrices of the k-Fibonacci numbers. Proyecciones 2013, 32, 347–357. [Google Scholar] [CrossRef] [Green Version]
  10. Jun, S.P.; Choi, K.H. Some properties of the generalized Fibonacci sequence 〈qn〉 by matrix methods. Korean J. Math. 2016, 24, 681–691. [Google Scholar] [CrossRef] [Green Version]
  11. Ying, S.J.; Kit, H.C.; Ibrahim, H.; Ahmad, N. Algebratic properties of generalized Fibonacci sequence via matrix methods. J. Eng. Appl. Sci. 2016, 11, 2396–2401. [Google Scholar]
  12. Catarino, P.; Borges, A. On Leonardo Numbers. Acta Math. Univ. Comen. 2020, LXXXIX, 75–86. [Google Scholar]
  13. Alp, Y.; Koçer, E.G. Some properties of Leonardo numbers. Konuralp J. Math. 2021, 9, 183–189. [Google Scholar]
  14. Alp, Y.; Koçer, E.G. Hybrid Leonardo numbers. Chaos Solitons Fractals 2021, 150, 111–128. [Google Scholar] [CrossRef]
  15. Shannon, A.G. A note on generalized Leonardo numbers. Notes Number Theory Discret. Math. 2019, 25, 97–101. [Google Scholar] [CrossRef] [Green Version]
  16. Kürüz, F.; Dağdeviren, A.; Catarino, P. On Leonardo Pisano Hybrinomials. Mathematics 2021, 9, 2923. [Google Scholar] [CrossRef]
  17. Hamilton, W.R. Lectures on Quaternions; Hodges and Smith: Dublin, Ireland, 1853. [Google Scholar]
  18. Cockle, J. On systems of algebra involving more than one imaginary. Philos. Mag. 1849, 35, 434. [Google Scholar]
  19. Clifford, W.K. Preliminary sketch of bi-quaternions. Proc. Lond. Math. Soc. 1873, 4, 381–395. [Google Scholar]
  20. Halıcı, S. On Fibonacci quaternions. Adv. Appl. Clifford Algebr. 2012, 22, 321–327. [Google Scholar] [CrossRef]
  21. Horadam, A.F. Complex Fibonacci numbers and Fibonacci quaternions. Am. Math. Mon. 1963, 70, 289–291. [Google Scholar] [CrossRef]
  22. Iyer, M.R. A note on Fibonacci quaternions. Fibonacci Quat. 1969, 7, 225–229. [Google Scholar]
  23. Kula, L.; Yaylı, Y. Split quaternions and rotations in semi-Euclidean space E42. J. Korean Math. Soc. 2007, 44, 1313–1327. [Google Scholar] [CrossRef] [Green Version]
  24. Akyiğit, M.; Kösal, H.H.; Tosun, M. Split Fibonacci quaternions. Adv. Appl. Clifford Algebras 2013, 23, 535–545. [Google Scholar] [CrossRef]
  25. Majernik, V. Quaternion formulation of the Galilean space-time transformation. Acta Phy. Slovaca 2006, 56, 9–14. [Google Scholar]
  26. Majernik, V. Galilean transformation expressed by the dual four-component numbers. Acta Phys.-Pol.-Ser. Gen. Phys. 1995, 87, 919–924. [Google Scholar] [CrossRef]
  27. Nurkan, S.K.; Güven, I.A. Dual Fibonacci quaternions. Adv. Appl. Clifford Algebras 2015, 25, 403–414. [Google Scholar] [CrossRef] [Green Version]
  28. Yüce, S.; Aydın, F.T. A new aspect of dual Fibonacci quaternions. Adv. Appl. Clifford Algebr. 2016, 26, 873–884. [Google Scholar] [CrossRef]
  29. Özdemir, M. Introduction to Hybrid Numbers. Adv. Appl. Clifford Algebras 2018, 28, 11. [Google Scholar] [CrossRef]
  30. Kızılateş, C.; Kone, T. On higher order Fibonacci hyper complex numbers. Chaos Solitons Fractals 2021, 148, 111044. [Google Scholar] [CrossRef]
  31. Gu, Y.Q. Hypercomplex numbers and roots of Algebraic eqution. J. Geom. Symmetry Phys. 2022, 64, 9–22. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Nurkan, S.K.; Güven, İ.A. Ordered Leonardo Quadruple Numbers. Symmetry 2023, 15, 149. https://doi.org/10.3390/sym15010149

AMA Style

Nurkan SK, Güven İA. Ordered Leonardo Quadruple Numbers. Symmetry. 2023; 15(1):149. https://doi.org/10.3390/sym15010149

Chicago/Turabian Style

Nurkan, Semra Kaya, and İlkay Arslan Güven. 2023. "Ordered Leonardo Quadruple Numbers" Symmetry 15, no. 1: 149. https://doi.org/10.3390/sym15010149

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop