1.
Introduction
Fibonacci and Lucas polynomials and their corresponding numbers play important parts in various disciplines. Fibonacci numbers arise in quite unexpected places. For example, they appear in nature, geography, and geometry. For some applications of these numbers, one can consult [1]. A large number of contributions were devoted to establishing formulas concerned with these polynomials and their corresponding numbers. For example, the authors in [2] found some results regarding the finite reciprocal sums of Fibonacci and Lucas polynomials. The authors in [3] derived some power sums of Fibonacci and Lucas numbers. New formulas of Fibonacci and Lucas numbers involving the golden ratio are developed in [4]. Some other contributions concerning these sequences of numbers and some of their related sequences can be found in [5,6,7,8,9].
Several types of sequences that generalize the standard Fibonacci and Lucas sequences are introduced and investigated in a variety of contributions by many authors. In [10], Muskat considered two classes of generalized Fibonacci and generalized Lucas numbers, and some root-finding methods are applied. In [11], Trojovskỳ considered a k− generalized Fibonacci sequence and found solutions to a certain Diophantine equation. The authors in [12] developed some relationships between some numbers related to Fibonacci and Lucas numbers. In [13], a new approach to generalized Fibonacci and Lucas numbers with binomial coefficients is followed. A generalized k-Horadam sequence is investigated in [14]. In [15], the authors developed some identities concerning k-balancing and k-Lucas-balancing numbers. A type of generalized Fibonacci numbers is introduced and investigated in [16]. The authors in [17] solved a quadratic Diophantine equation involving the generalized Fibonacci numbers. In [18], some arithmetic properties and new pseudo primality results for the generalized Lucas sequences were provided. Some arithmetic properties of the generalized Lucas sequences are developed in [19]. The authors in [20] introduced and investigated distance Fibonacci Polynomials. There are interesting numbers in the literature that can be considered special ones of various generalized Fibonacci numbers and generalized Lucas numbers. For example, the celebrated numbers, namely, Jacobsthal, Jacobsthal-Lucas, balancing, and co-balancing numbers, can be extracted from some generalized sequences of numbers. For some studies regarding different celebrated sequences of numbers, one can be referred, for example, to [21,22,23,24,25].
From a numerical point of view, several types of Fibonacci and Lucas polynomials and their generalized and modified polynomials were utilized to find numerical solutions to some types of differential equations. For example, Abd-Elhameed and Youssri in the series of papers [26,27,28,29] solved some types of fractional differential equations utilizing Fibonacci and Lucas polynomials and some of their generalized polynomials. A Fibonacci wavelet method was utilized in [30] for solving the time-fractional bioheat transfer model. Certain modified Lucas polynomials were employed in [31] to treat some fractional optimal control problems. The authors in [32] used a certain generalized Lucas polynomial sequence to treat numerically the fractional pantograph differential equation.
In [33], Abd-Elhameed and Zeyada have considered two sets of generalized Fibonacci numbers {Uc,dj}j≥0 and generalized Lucas numbers {Vc,dj}j≥0 that can be constructed respectively by means of the following recurrence relations:
and
and they developed some new identities involving the generalized Fibonacci and Lucas numbers. The famous identities of Sury and Marques were deduced as special cases, see [34,35]. Furthermore, Abd-Elhameed and Zeyada in [36] have considered another sequence of generalized numbers involving three parameters {Wc,d,rj}j≥0 that can be generated by the following recurrence relation:
and they developed some other identities involving the generalized numbers Wc,d,rj.
An an important class of generalized numbers that generalizes the three classes of the generalized Fibonacci and Lucas numbers constructed by means of the three recurrence relations (1.1)–(1.3) is the Horadam sequence of numbers {Gp,q,a,bi}i≥0 [37] that can constructed with the aid of the following recurrence relation:
where p,q,a,b are arbitrary integers.
Horadam in [37] presented some basic properties of the sequence {Gp,q,a,bi}i≥0, while he derived the generating function of this sequence of numbers in [38]. Some convoluted formulas concerned with these numbers are derived in [39]. In addition, Melham in [40] derived some other identities concerned with the same sequence of numbers.
This paper is concerned with deriving some new formulas concerned with the Horadam generalized sequence of numbers {Gp,q,a,bi}i≥0. The presence of four parameters in the sequence of numbers implies that several celebrated numbers such as the generalized Fibonacci, generalized Lucas, Fibonacci, Lucas, Pell, Pell-Lucas, Fermat, Fermat-Lucas, Jacobsthal, Jacobsthal-Lucas, balancing, and co-balancing numbers. can be considered special ones of our considered generalized numbers of four parameters [41]. This gives a motivation to consider and investigate the generalized sequence of numbers. Another motivation to consider the generalized numbers is that many identities concerned with them generalize some identities that exist in the literature.
We can summarize the aims of this article in the following items.
● Developing a new explicit expression of these numbers.
● Deriving a recurrence relation that is satisfied between two certain generalized number sequences.
● Developing new identities between two generalized classes of numbers.
● Deducing some specific identities involving the special numbers namely, Fibonacci, Lucas, Pell, Pell-Lucas, Fermat, Fermat-Lucas, Jacobsthal, Jacobsthal-Lucas, balancing, and co-balancing numbers.
The contents of the rest of the paper are structured as follows. Section 2 introduces an account of the Horadam sequence of generalized numbers that involves four parameters. Some of their fundamental properties are given. It is also shown in this section that some of the celebrated numbers can be considered special ones of them. In Section 3, two basic theorems concerned with the generalized sequence of numbers are stated and proved. In the first theorem, we give an explicit expression to these generalized numbers, while in the second theorem, a new recurrence relation concerned with two certain families of these numbers is given. Section 4 presents the main results of this paper. Some new identities are given in this respect. Moreover, some special identities are given from the new results in this section. Section 5 is devoted to presenting other identities between some generalized and specific classes of numbers. Finally, Section 6 displays the conclusion.
2.
Some fundamental properties of the sequence {Gp,q,a,bi}i≥0
This section is devoted to presenting some basic formulas of the generalized sequence of numbers {Gp,q,a,bi}i≥0.
It is worthy to note here that the sequence of numbers {Gp,q,a,bi}i≥0 can be considered as a generalization of the three number sequences {Uc,di}i≥0,{Vc,di}i≥0 and {Wc,d,ri}i≥0 that generated respectively by the recurrence relations given in (1.1)–(1.3), for suitable choices of p,q,a and b.
It is not difficult to write the Binet's form for Gp,q,a,bi. In fact, these numbers can be represented as
where c1 and c2 are constants to be determined, and α and β are the roots of the characteristic equation of (1.4), given by
so, we have
It is not difficult to determine c1 and c2 to give
and this leads to the following Binet's form for Gp,q,a,bi
that is
This class of the generalized numbers {Gp,q,a,bi}i≥0 has the advantage that several generalized and specific classes of numbers can be deduced from it. In fact, by selecting suitable choices of the involved four parameters in (1.4), these celebrated numbers can be deduced. In Table 1, we display some of these numbers that can deduced as special cases from the generalized numbers {Gp,q,a,bi}i≥0. In every row of this table, we write the corresponding values of the four parameters a,b,p,q for each sequence accompanied by its corresponding recurrence relation.
It is worth mentioning that the generating function of the sequence of numbers {Gp,q,a,bi}i≥0 is established by Horadam [38] as:
3.
Two new basic formulas concerned with the numbers Gp,q,a,bi
This section is interested in developing two new basic formulas of the generalized numbers Gp,q,a,bi generated by means of the recurrence relation (1.4). In the first theorem, we give a new explicit expression for these numbers. The second theorem links between the two families of numbers sequences {Gp,q,a,bi}i≥0 and {Gp,q,c,di}i≥0.
Theorem 3.1. The generalized numbers Gp,q,a,bi generated by the recurrence relation (1.4) can be explicitly expressed by the following formula:
where ⌊z⌋ represents the well-known floor function, and (ξ)n represents the Pochhammer symbol, that is: (ξ)n=Γ(ξ+n)Γ(ξ).
Proof. First, assume that
It is easy to see that: Fp,q,a,b0=a and Fp,q,a,b1=b, so to show that Fp,q,a,bi=Gp,q,a,bi, we need to show that it satisfies the same recurrence relation in (1.4). For this purpose, set
and we will show the validity of the following identity:
Due to (3.2), we can write
where
To show the validity of (3.3), we consider the following two cases.
Case 1: For i=2j. In such case, Formula (3.4) leads to the following formula
that is can be written as
Now, to get a closed-form for the summation that appears in (3.6), we set
and make use of the Zeilberger's algorithm through the Maple software, and in particular, the "sumrecursion command" [42] to show that Hn,j satisfies the following recurrence relation of order one:
which can be easily solved to give
Relation (3.7) along with relation (3.6) leads to
Case 2: For i=2j+1. In such case, Formula (3.4) leads to the following formula
that can be written explicitly as
Now, set
Making use of Zeilberger's algorithm again leads to the following recurrence relation:
that can be easily solved to give
and accordingly,
The two Formulas (3.8) and (3.9) show the desired result of Theorem 3.1.
Now, the following theorem is useful in the sequel. In this theorem, we will give a recurrence relation between the two classes of numbers {Gp,q,a,bi}i≥0 and {Gp,q,c,di}i≥0.
Theorem 3.2. For q≠0 and a2q+abp−b2≠0, the following recurrence relation holds for every non-negative integer i:
Proof. To show the validity of the recurrence relation (3.10), we prove that
where
We are going to prove that
The proofs of the two identities are similar, We will prove that L2i+1=0.
In virtue of the explicit representation of Gp,q,a,bi in (3.1), we can write L2i+1 in the form
where
Relation (3.12) can be written alternatively as
and
It can be shown that
and accordingly
Theorem 3.2 is now proved.
4.
New identities involving the generalized numbers Gp,q,a,bi
This section is confined to presenting new identities involving the generalized numbers Gp,q,a,bi. Some identities involving the generalized Fibonacci, generalized Lucas, Fibonacci, Lucas, Pell, Pell-Lucas, Fermat, Fermat-Lucas, Jacobsthal, Jacobsthal-Lucas, balancing, and co-balancing numbers are also deduced as special cases.
Theorem 4.1. Let k be a non-negative integer, and let x∈R∗=R−{0}. For −bd+acq+bcp≠0, one has
Proof. We will prove the result by induction. For k=0, it is easy to see that the left-hand side equals the right-hand side which is equal to (bx). Now assume the validity of (4.1), and then to complete the proof, we have to prove the following identity:
It is clear that each side of relation (4.2) is a polynomial of degree (k+2). Now, let
Now to show (4.2), it suffices to show the validity of the following formula
The polynomial M(x) can be written in the form
Making use of the inductive step leads to
If we insert the mixed recurrence relation (3.10) written in the form
into relation (4.4), then after collecting the similar terms, the following identity can be obtained:
In virtue of the recurrence relation (1.4), and doing some simplifications enable one to reduce M(x) in the form
and hence the following formula is obtained
This completes the proof of Theorem 4.1.
Several special formulas involving some generalized Fibonacci and generalized Lucas numbers can be deduced as special cases of Theorem 4.1. The following corollaries display some identities between the generalized numbers of four parameters and the generalized Fibonacci and generalized Lucas numbers that are generated respectively by the two recurrence relations in (1.1) and (1.2).
Corollary 4.1. Let k be a non-negative integer, and x∈R∗. For cp≠d, one has
Proof. The substitution by a=0,b=1 in Identity (4.1) yields relation (4.7).
Corollary 4.2. Let k be a non-negative integer, and x∈R∗. Then for b≠0, one has
Proof. The substitution by c=0,d=1 in Identity (4.1) yields relation (4.8).
Corollary 4.3. Let k be a non-negative integer, and x∈R∗. Then for c(p2+2q)≠dp, one has
Proof. The substitution by a=2,b=p in Identity (4.1) yields relation (4.9).
Corollary 4.4. Let k be a non-negative integer, and x∈R∗. Then for bp+2aq≠0, one has
Proof. The substitution by c=2,d=p in Identity (4.1) yields relation (4.10).
Taking into consideration the special number sequences mentioned in Table 1, the following corollaries provide some of the special formulas.
Corollary 4.5. For the generalized classes of Fibonacci and Lucas numbers that generated respectively by the two recurrence relations (1.1) and (1.2), the following two identities hold if k is a non-negative integer, x∈R∗, and p≠0
Proof. Identity (4.11) is a direct consequence of Identity (4.7) for the special case corresponding to c=2 and d=p, while Identity (4.12) is a direct consequence of Identity (4.10) for the special case corresponding to c=0 and d=1.
Remark 4.1. The Identity (4.11) coincides with that obtained in [33].
Remark 4.2. Since the Fibonacci, Pell, Fermat, Jacobsthal and balancing numbers are special ones of the generalized Fibonacci numbers Up,qk, and the Lucas, Pell-Lucas, Fermat-Lucas, Jacobsthal-Lucas and co-balancing numbers are special ones of the generalized Lucas numbers Vp,qk, so the two Identities (4.11) and (4.12) lead to some interesting identities concerning these celebrated numbers. The following corollaries display these identities.
Corollary 4.6. For Fibonacci and Lucas numbers, the following two identities hold for every non-negative integer k, and every x∈R∗:
Proof. If we set a=1 and b=1 in (4.11) and (4.12) respectively, the two Identities (4.13) and (4.14) can be obtained.
Corollary 4.7. For Pell and Pell-Lucas numbers, the following two identities hold for every non-negative integer k, and every x∈R∗:
Proof. If we set a=2 and b=1 in (4.11) and (4.12) respectively, the two Identities (4.15) and (4.16) can be obtained.
Corollary 4.8. For Fermat and Fermat-Lucas numbers, the following two identities hold for every non-negative integer k, and every x∈R∗:
Proof. If we set a=3 and b=−2 in (4.11) and (4.12) respectively, the two Identities (4.17) and (4.17) can be obtained.
Corollary 4.9. For Jacobsthal and Jacobsthal-Lucas numbers, the following two identities hold for every non-negative integer k, and every x∈R∗:
Proof. If we set a=1 and b=2 in (4.11) and (4.12) respectively, the two Identities (4.19) and (4.19) can be obtained.
Corollary 4.10. For balancing and co-balancing numbers, the following two identities hold for every non-negative integer k, and every x∈R∗:
Proof. If we set a=6 and b=−1 in (4.11) and (4.12) respectively, the two Identities (4.21) and (4.21) can be obtained.
5.
Some other identities involving the generalized numbers
This section concentrates on introducing some other identities concerned with the Horadam generalized numbers Gp,q,a,bk and some of their special numbers.
Theorem 5.1. For every non-negative integer k, every x∈R∗, and for bcp+acq≠bd, one has
Proof. If we differentiate both sides of (4.1) with respect to x, then Identity (5.1) can be obtained.
Taking into consideration the special numbers of the generalized numbers Gp,q,a,bi+1 that can be deduced by choosing the four parameters p,q,a and b suitably, then some identities can be deduced are direct consequences of Theorem 5.1. The following theorem exhibits these identities.
Corollary 5.1. For the generalized Fibonacci and generalized Lucas numbers, the following two identities hold for every non-negative integer k, every x∈R∗, and for p≠0:
Corollary 5.2. For Fibonacci and Lucas numbers, the following two identities hold for every non-negative integer k, every x∈R∗:
Corollary 5.3. For Pell and Pell-Lucas numbers, the following two identities hold for every non-negative integer k, every x∈R∗:
Corollary 5.4. For Fermat and Fermat-Lucas numbers, the following two identities hold for every non-negative integer k, every x∈R∗:
Corollary 5.5. For Jacobsthal and Jacobsthal-Lucas numbers, the following two identities hold for every non-negative integer k, every x∈R∗:
Corollary 5.6. For balancing and co-balancing numbers, the following two identities hold for every non-negative integer k, every x∈R∗:
Remark 5.1. All the above identities in Sections 4 and 5 can be generalized if both sides of Eq (4.1) is differentiated r−times. The following theorem is a generalization of Theorem 4.1.
Theorem 5.2. For all non-negative integer k,r, every x∈R∗, and for bcp+acq≠bd, the following identity is valid:
Proof. Differentiating both sides of (4.1) with respect to x yields the following identity:
with
that can be written after some simplifications in the form
In the following, we write the generalizations of Corollaries 11–16 which are special cases of the general result in Theorem 5.2. They can be deduced by selecting the six parameters p,q,a,b,c and d that appears in Identity (5.14).
Corollary 5.7. For all non-negative integer k,r, every x∈R∗, and for p≠0, the following two identities are valid:
Corollary 5.8. For Fibonacci and Lucas numbers, the following two identities hold for all non-negative integers k and r, every x∈R∗:
Corollary 5.9. For Pell and Pell-Lucas numbers, the following two identities hold for all non-negative integers k and r, every x∈R∗:
Corollary 5.10. For Fermat and Fermat-Lucas numbers, the following two identities hold for all non-negative integers k and r, every x∈R∗:
Corollary 5.11. For Jacobsthal and Jacobsthal-Lucas numbers, the following two identities hold for all non-negative integers k and r, every x∈R∗:
Corollary 5.12. For balancing and co-balancing numbers, the following two identities hold for all non-negative integers k and r, every x∈R∗:
6.
Conclusions
In this paper, we have investigated Horadam generalized numbers involving four parameters that generalize some generalized and specific types of Fibonacci and Lucas numbers. A new identity involving six parameters was derived. Some of the interesting identities involving generalized and specific numbers such as Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal, Jacobsthal-Lucas, balancing, and co-balancing numbers were extracted as special cases. Some well-known identities in the literature can be extracted from our identities as special cases by selecting suitably the involved parameters. In future work, we aim to perform some other studies regarding these generalized numbers. In addition, we aim to study other types of generalized Fibonacci and Lucas numbers.
Acknowledgements
The authors would like to thank the Deanship of Scientific Research at Umm Al-Qura University for supporting this work by Grant Code: 22UQU4331287DSR03.
Conflict of interest
The authors declare that they have no competing interests.