Abstract
The goal of this study is to develop some new connection formulae between two generalized classes of Fibonacci and Lucas polynomials. Hypergeometric functions of the kind are included in all connection coefficients for a specific z. Several new connection formulae between some famous polynomials, such as Fibonacci, Lucas, Pell, Fermat, Pell–Lucas, and Fermat–Lucas polynomials, are deduced as special cases of the derived connection formulae. Some of the introduced formulae generalize some of those existing in the literature. As two applications of the derived connection formulae, some new formulae linking some celebrated numbers are given and also some newly closed formulae of certain definite weighted integrals are deduced. Based on using the two generalized classes of Fibonacci and Lucas polynomials, some new reduction formulae of certain odd and even radicals are developed.
Keywords:
generalized Fibonacci and generalized Lucas numbers; Lucas and Fibonacci numbers; recurrence relation; radicals reduction MSC:
11B83; 11B39
1. Introduction
The Fibonacci and Lucas sequences are among the important number sequences. These sequences of numbers and their corresponding polynomials can be generated by recurrence relations, each of degree two. In fact, these sequences of polynomials and numbers are crucial in a variety of fields, such as number theory, probability, combinatorics, numerical analysis, and physics, so investigations of these sequences attract the attention of many mathematicians and scientists. From a theoretical point of view, there are several studies concerning Fibonacci and Lucas sequences, see, for instance, [1,2]. In addition, in the important books of Koshy [3] and Djordjevic and Milovanovic [4], the authors studied various sequences related to the Fibonacci and Lucas sequences and some of their generalizations.
Many authors devoted considerable attention to the generalizations of the Fibonacci and Lucas sequences of numbers and polynomials. For example, Fibonacci k-numbers were considered in [5]. In [6], the authors developed new identities for the two classes of Fibonacci and Lucas polynomials. Horadam in [7] is considered an important class of generalized numbers that involves four parameters. Abd-Elhameed et al. in [8] have investigated the same sequence of Horadam numbers and developed new identities of these numbers. The authors in [9] studied a type of generalized Fibonacci numbers. A type of generalized Fibonacci polynomials, namely, distance Fibonacci polynomials, was investigated in [10]. A four-parameter generalization of some special sequences was also considered in [11]. Some other studies regarding different types of generalized sequences can be found for example in [12,13,14,15].
If we have two polynomial sets and , then to solve the connection problem between them, we have to find the connection coefficients in the equation:
The coefficients in (1) have prominent parts in several problems in mathematics as well as in mathematical physics. Due to this importance, the connection problems between various polynomials have been investigated by many authors. In this regard, Abd-Elhameed et al. in [16] solved the connection problems between Fibonacci polynomials and Chebyshev polynomials of first and second kinds. Some other studies concerning connection problems can be found in [17,18].
In the field of special functions and their applications, hypergeometric functions play an important role (see, for example, [19,20]). In fact, nearly all of mathematics’ fundamental functions are hypergeometric or ratios of hypergeometric functions. Furthermore, numerous hypergeometric functions are widely used to express connection and linearization coefficients (see, for example, [21,22]).
Here are the main points of this article:
- We solve the connection problems between two certain classes of polynomials generalizing Fibonacci and Lucas polynomials. For a specific z, we prove that the obtained expressions involve hypergeometric functions of the form .
- We develop some applications of the introduced connection formulae. In this respect, two applications are presented. In the first, some new formulae between some celebrated numbers are given. In the second, some definite weighted integrals are evaluated in closed forms.
- We employ the two classes of generalized Fibonacci and generalized Lucas polynomials to obtain new reduction formulae of certain kinds of even and odd radicals.
The following is a list of the paper’s contents. The two generalized Fibonacci and Lucas polynomials are discussed in the next section, which includes some essential properties and helpful relations. The development of new connection formulae between the two introduced generalized polynomials is the focus of Section 3. In Section 4, we establish some further connection equations between two polynomials from the same generalized polynomials class. Section 5 introduces two uses of the previously stated connection formulae. Section 6 is interested in using the two introduced generalized classes of polynomials to develop new expressions for particular even and odd radicals. In Section 7, new expressions for a few additional radicals are developed. We end the paper with some conclusions in Section 8.
2. Some Properties of Two Generalized Classes of Fibonacci and Lucas Polynomials
We discuss some properties of the two classes of generalized Fibonacci and Lucas polynomials in this section.
First, let and s be nonzero real numbers. Two classes generalizing Fibonacci and Lucas polynomials can be generated by means of the following two recurrence relations:
and
Note that for each , and are of degree j.
See also Philippou [23,24] and references therein for different generalized Fibonacci and Lucas polynomials. In addition, they are very useful in probability and reliability theory as well.
Binet’s formula for is given by [25],
while Binet’s formulae for is given by [26],
Two of the most useful properties of the two polynomials and are their power form representations. These expressions are given respectively in [25,26] in the following two combinatorial forms:
and
Formulae (6) and (7) yield the following functional formulae between the generalized Fibonacci and generalized Lucas polynomials and certain special classes of them. More precisely, we have
and
The inversion formulae of (6) and (7) are also of interest. The authors in [25] found the inversion formula of in the form
while the same authors proved in [26] that the inversion of can be expressed as:
where
The fundamental benefit of making use of the two generalized polynomials and is that several important classes of polynomials can be obtained as special cases of them. In fact, Fibonacci, Pell, Fermat, Chebyshev, and Dickson polynomials of the second kind are special kinds of , while Lucas, Pell–Lucas, Fermat–Lucas, Chebyshev, and Dickson polynomials of the first kind are special polynomials of . Table 1 displays the different celebrated special classes of the two generalized classes of polynomials.
Table 1.
Special cases of the two generalizing classes.
3. Connection Formulae between the Two Generalized Classes of Fibonacci and Lucas Polynomials
This section concentrates on the development of new connection formulae between the two generalized polynomial classes considered in Section 2. Several connection formulae between some famous polynomials are also deduced as special cases. The connection coefficients are expressed in terms of for certain z.
In this instance, we refer to the definition of the hypergeometric function (see [19]),
where , and are complex or real parameters, with not zero nor a negative integer.
Now, the following lemma is needed.
Lemma 1.
Let and s be any nonzero real numbers and let
fulfills the following recurrence relation:
Proof.
Lemma 1 can be proved via straightforward lengthy computations in view of the definition of the hypergeometric function . □
Theorem 1.
The following connection formula applies for any non-negative integer i:
where the numbers are those given in Equation (9).
Theorem 2.
The following connection formula applies for any non-negative integer i with :
Proof.
Similar approaches can be used to prove Theorems 1 and 2. Therefore, it is sufficient to prove Theorem 2. We proceed by induction. For the starting value , it is easy to see that each of the two sides in (11) is equal to . Now, assume that (11) holds for all , and we show that (11) is itself valid. If we start with the recurrence relation in (3) and apply the induction hypothesis twice, then we get
where
The recurrence relation in (2) implies that
After some algebraic calculations, the last relation can be transformed into the equivalent one:
where
In virtue of Lemma 1, one can rewrite (14) in the form
It is not difficult to see that (15) can be written alternatively as
The proof of Theorem 2 is now complete. □
Next, we give a special case of Formula (10).
Corollary 1.
Proof.
The substitution by and into Relation (10) yields the following relation:
With the aid of the Chu–Vandermond identity, it is easy to see that
and consequently, Formula (16) can be easily obtained. □
Taking into consideration the special polynomials of the two classes and mentioned in Table 1, several connection formulae can be deduced as special cases of Corollary 1.
Corollary 2.
For a non-negative integer i, the following connection formulae hold:
Remark 1.
Corollary 3.
Proof.
The substitution of and into Relation (11) yields the following relation:
□
Taking into consideration the special polynomials of the two classes and , several simple connection formulae can be deduced as special cases of Relation (18).
Corollary 4.
For every non-negative integer i with , the following connection formulae hold:
4. Connection Formulae between Two Different Generalized Polynomials in the Same Class
This section is concerned with introducing other new connection formulae. We give connection formulae between two different generalized Fibonacci polynomials. Connection formulae between two generalized Lucas polynomials of different parameters are also given. We show again that all the connection coefficients are expressed in terms of for a certain z.
Theorem 3.
The following connection formula applies for every non-negative integer i:
Theorem 4.
The following formula applies for every non-negative integer i:
where the constants are those given in (9).
Proof.
Theorems 3 and 4 can be proved using similar procedures followed in the proof of Theorem 2, but we give here another strategy of proof which is built on making use of the power form representation of each of and and their inversion formulae. Now, we are going to prove Theorem 3. Making use of the analytic form of in (6) enables one to write
Expressing the term that appears in (22) in terms of the polynomials using the inversion formula in (8) leads to the following formula:
Rearranging the right-hand side of the last relation and performing some lengthy manipulations enables one to obtain the following relation:
□
Remark 2.
Corollary 5.
Corollary 6.
Corollary 7.
5. Two Applications of the Introduced Connection Formulae
In this section, we present two applications of the connection formulae derived in Section 3 and Section 4. In the first, we give some new relations between some celebrated numbers and in the second application, some new definite weighted integrals are given.
5.1. Formulae between Some Celebrated Numbers
Theorems 1–4 enable one to join two families of numbers, whether they either belong to the same class of generalized Fibonacci or Lucas numbers or they belong to two different such classes. With respect to the six families of numbers and defined in Table 1, there are thirty relations linking them. All the coefficients between them involve for a certain z. In six cases only, the appearing can be summed. They are given explicitly in the following corollary.
Corollary 8.
For every non-negative integer i, the following identities are valid:
Now, with respect to the remaining twenty-four relations among the celebrated sequences of numbers, they can be deduced easily by setting in the relations of Theorems 1–4, taking into consideration the different special cases of the two generalized polynomials and .
5.2. Some Definite Weighted Integrals
In this section, and based on the connection formulae developed in Section 3 and Section 4, some definite weighted integrals are given in terms of certain hypergeometric functions of the type . Some of these results are given in the following two corollaries.
Corollary 9.
For all non-negative integers with , the following two integral formulae hold:
and
6. Reduction of Some Odd and Even Radicals
In this section, we introduce some new reduction formulae of certain odd and even radicals through the employment of the two classes of generalized Fibonacci and Lucas polynomials introduced in Section 2. The problems of the reduction of radicals are of interest. There are considerable contributions regarding the reduction of various kinds of radicals (see, for example, [27,28,29,30,31,32]). First, the following lemma is basic in the sequel.
Lemma 2.
For every non-negative integer k, the following formula is valid:
Proof.
The two Binet’s formulae in (4) and (5) can be rewritten in the form
and
where
and consequently, we have
Lemma 2 is now proved. □
6.1. New Formulae of Some Odd Radicals
We state and prove the following theorem in which we show how to reduce some odd radicals using the two generalized Fibonacci and Lucas polynomials.
Theorem 5.
Let k be any positive odd integer. Then for every such that , the following two identities hold:
and
Proof.
The idea of the proof is built on making use of the two Binet’s formulae in (31) and (32). From (33), it is clear that
Corollary 10.
Let k be any positive odd integer. Then for nonzero real numbers a and b with , there are infinite numbers of expressions of unit radicals in the sense that
As a consequence of Theorem 5 and taking into consideration the special polynomials of in Table 1, we obtain some new reduction formulae of some odd radicals involving Lucas, Pell–Lucas, Fermat–Lucas, Chebyshev, and Dickson polynomials of the first kinds. The following corollaries display these formulae.
Corollary 11.
For every positive integer i, the following reduction formulae hold:
- 1.
- For all , one has
- 2.
- For all , one has
- 3.
- For all , one has
- 4.
- For all , one has
- 5.
- Either for all whenever or for all whenever , one has
If we put in the first three items of the above corollary, we get the following new interesting reduction formulae of some odd radicals involving Lucas, Pell–Lucas, and Fermat–Lucas numbers.
Corollary 12.
For every non-negative integer i, one has
In the following example, we give the reduction formulae of a few radicals as an application of Corollary 11.
Example 1.
The following identities are valid:
- 1.
- 2.
- 3.
- 4.
- 5.
6.2. New Reduction Formulae of Some Even Radicals
This section is devoted to presenting the new formulae of some even radicals.
Theorem 6.
Let k be any positive even integer. Then for every real number with , the following two identities hold:
and
Proof.
Let k be a positive even integer. In view of Equation (4), for all real numbers x with , if and only if .
As consequences of Theorem 6, we give some reduction formulae of certain even radicals. These formulae are shown in the corollary below.
Corollary 13.
For every positive integer i and for every real number x, the following formulae hold:
- 1.
- For all , one has
- 2.
- For all , one has
- 3.
- For all , one has
- 4.
- For all , one has
In the following example, we give the formulae of some specific even radicals based on Corollary 13.
Example 2.
The following identities are valid:
- 1.
- 2.
- 3.
- 4.
7. Some Other Radical Formulae
The purpose of this section is to establish two other reduction formulae for some radicals. In the sequel, the following lemma is required.
Lemma 3.
For every positive integer j and every , one has
Proof.
Binet’s formula in (5) implies that
The proof is now complete. □
Theorem 7.
If j is an odd positive integer and , then for every , the following identity applies:
Proof.
The following results are direct consequences of Theorem 7.
Corollary 14.
If j is an odd positive integer, then the following identities are true for Lucas, Pell–Lucas, Fermat–Lucas, and Chebyshev polynomials of the first kind:
Example 3.
As an application of Corollary 14, which is a corollary of Theorem 7, we readily get (for and ) the following odd reduction formula:
The following theorem exhibits the counterpart result of Theorem 7 for even radicals.
Theorem 8.
If j is an even positive integer, then the following identity applies for every nonzero real number x:
Example 4.
The dedication for Paper [31] reads: "In memory of Ramanujan on the
anniversary of his birth."
This radical was calculated by Osler in [30] using Cardan polynomials. In the following few lines, we show that it can be evaluated with the aid of Theorem 8. In fact, if we note that
then we have
8. Conclusions
In this paper, we established several new connection formulae between some classes of polynomials generalizing the celebrated Fibonacci and Lucas polynomials. Some of these formulae generalize respective known ones. Two applications of the derived connection formulae were presented. A number of new expressions between the celebrated Fibonacci, Pell, Fermat, Lucas, Pell–Lucas, and Fermat–Lucas numbers were deduced. As a very important utilization of the two generalized Fibonacci and Lucas polynomials, some new reduction formulae of certain odd and even radicals were given. We have deduced as special cases several reduction formulae of certain radicals involving Lucas, Pell–Lucas, Fermat–Lucas, Chebyshev, and Dickson polynomials of the first and second kinds. Numerous examples were given to apply the reduction of radicals. As far as we know, most of the formulae in this paper are new and they are thought to be crucial and useful. Furthermore, we do believe that other generalizations of Fibonacci and Lucas sequences of numbers and polynomials can be considered. In the near future, we hope to consider and investigate some of these generalized sequences.
Author Contributions
Conceptualization, W.M.A.-E.; Formal analysis, W.M.A.-E.; Investigation, W.M.A.-E., A.N.P. and N.A.Z.; Methodology, W.M.A.-E. and N.A.Z.; Software, W.M.A.-E.; Validation, W.M.A.-E. and A.N.P.; Visualization, Nasr Zeyada; Writing—original draft, W.M.A.-E. and N.A.Z. 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.
Acknowledgments
The authors would like to thank the editor for his cooperation and the anonymous referees for their constructive comments.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Zhang, W. On Chebyshev polynomials and Fibonacci numbers. Fibonacci Quart. 2002, 40, 424–428. [Google Scholar]
- Gulec, H.H.; Taskara, N.; Uslu, K. A new approach to generalized Fibonacci and Lucas numbers with binomial coefficients. Appl. Math. Comput. 2013, 220, 482–486. [Google Scholar] [CrossRef]
- Koshy, T. Fibonacci and Lucas Numbers with Applications, Volume 2; John Wiley & Sons: Hoboken, NJ, USA, 2019. [Google Scholar]
- Djordjevic, G.B.; Milovanovic, G.V. Special Classes of Polynomials; University of Nis, Faculty of Technology Leskovac: Niš, Serbia, 2014. [Google Scholar]
- Falcon, F.; Plaza, A. On the Fibonacci k-numbers. Chaos Soliton Fract. 2007, 32, 1615–1624. [Google Scholar] [CrossRef]
- Abd-Elhameed, W.M.; Zeyada, N.A. New formulas including convolution, connection and radicals formulas of k-Fibonacci and k-Lucas polynomials. Ind. J. Pure Appl. Math. 2022. [Google Scholar] [CrossRef]
- Horadam, A.F. Basic properties of a certain generalized sequence of numbers. Fibonacci Quart. 1965, 3, 161–176. [Google Scholar]
- Abd-Elhameed, W.M.; Amin, A.K.; Zeyada, N.A. Some new identities of a type of generalized numbers involving four parameters. AIMS Math. 2022, 7, 12962–12980. [Google Scholar] [CrossRef]
- Yayenie, O. A note on generalized Fibonacci sequences. Appl. Math. Comput. 2011, 217, 5603–5611. [Google Scholar] [CrossRef]
- Bednarz, U.; Wołowiec-Musiał, M. Distance Fibonacci Polynomials. Symmetry 2020, 12, 1540. [Google Scholar] [CrossRef]
- da Silva, R.; de Oliveira, K.S.; da Graça Neto, A.C. On a four-parameter generalization of some special sequences. Discrete Appl. Math 2018, 243, 154–171. [Google Scholar] [CrossRef]
- Dilcher, K.; Pisano, L. Hypergeometric functions and Fibonacci numbers. Fibonacci Q. 2000, 38, 342–362. [Google Scholar]
- Ye, X.; Zhang, Z. A common generalization of convolved generalized Fibonacci and Lucas polynomials and its applications. Appl. Math. Comput. 2017, 306, 31–37. [Google Scholar] [CrossRef]
- Muskat, J.B. Generalized Fibonacci and Lucas sequences and rootfinding methods. Math. Comp. 1993, 61, 365–372. [Google Scholar] [CrossRef]
- Włoch, A. Some identities for the generalized Fibonacci numbers and the generalized Lucas numbers. Appl. Math. Comput. 2013, 219, 5564–5568. [Google Scholar] [CrossRef]
- Abd-Elhameed, W.M.; Youssri, Y.H.; El-Sissi, N.; Sadek, M. New hypergeometric connection formulae between Fibonacci and Chebyshev polynomials. Ramanujan J. 2017, 42, 347–361. [Google Scholar] [CrossRef]
- Area, I.; Godoy, E.; Ronveaux, A.; Zarzo, A. Solving connection and linearization problems within the Askey scheme and its q-analogue via inversion formulas. J. Comput. Appl. Math. 2001, 133, 151–162. [Google Scholar] [CrossRef]
- Maroni, P.; da Rocha, Z. Connection coefficients between orthogonal polynomials and the canonical sequence: An approach based on symbolic computation. Numer. Algor. 2008, 47, 291–314. [Google Scholar] [CrossRef]
- Andrews, G.E.; Askey, R.; Roy, R. Special Functions; Number 71; Cambridge University Press: Cambridge, UK, 1999. [Google Scholar]
- Rainville, E.D. Special Functions; The Maximalan Company: New York, NY, USA, 1960. [Google Scholar]
- Tcheutia, D.D. On Connection, Linearization and Duplication Coefficients of Classical Orthogonal Polynomials. Ph.D. Thesis, Universität Kassel, Kassel, Germany, 2014. [Google Scholar]
- Abd-Elhameed, W.M. New formulae between Jacobi polynomials and some fractional Jacobi functions generalizing some connection formulae. Anal. Math. Phys. 2019, 9, 73–98. [Google Scholar] [CrossRef]
- Philippou, A.N. Distributions and Fibonacci polynomials of order k, longest runs, and reliability of consecutive-k-out-of-n: F systems. In Fibonacci Numbers and Their Applications; Philippou, A.N., Bergum, G.E., Horadam, A.F., Eds.; Reidel Publishing Company: Dordrecht, The Netherland, 1986; pp. 203–227. [Google Scholar]
- Philippou, A.N. Fibonacci polynomials. Invited Contribution in Encyclopedia of Mathematics, Supplement III; Hazewinkel, M., Ed.; Kluwer Academic Publishers: Dordrecht, The Netherland, 2002; pp. 152–154. [Google Scholar]
- Abd-Elhameed, W.M.; Youssri, Y.H. Spectral tau algorithm for certain coupled system of fractional differential equations via generalized Fibonacci polynomial sequence. Iran. J. Sci. Technol. Trans. A Sci. 2019, 43, 543–554. [Google Scholar] [CrossRef]
- Abd-Elhameed, W.M.; Youssri, Y.H. Generalized Lucas polynomial sequence approach for fractional differential equations. Nonlinear Dynam. 2017, 89, 1341–1355. [Google Scholar] [CrossRef]
- Wituła, R.; Słota, D. Cardano’s formula, square roots, Chebyshev polynomials and radicals. J. Math. Anal. Appl. 2010, 363, 639–647. [Google Scholar] [CrossRef]
- Dattoli, G.; Di Palma, E.; Sabia, E. Cardan polynomials, Chebyshev exponents, ultra-radicals and generalized imaginary units. Adv. Appl. Clifford Algebr. 2015, 25, 81–94. [Google Scholar] [CrossRef]
- Landau, S. Simplification of nested radicals. SIAM J. Sci. Comput. 1992, 21, 85–110. [Google Scholar] [CrossRef]
- Osler, T.J. Cardan polynomials and the reduction of radicals. Math. Mag. 2001, 74, 26–32. [Google Scholar] [CrossRef]
- Berndt, B.C.; Chan, H.H.; Zhang, L.C. Ramanujan’s association with radicals in India. Am. Math. Mon. 1997, 104, 905–911. [Google Scholar] [CrossRef]
- Berndt, B.C.; Chan, H.H.; Zhang, L.C. Radicals and units in Ramanujan’s work. Acta Arith. 1998, 87, 145–158. [Google Scholar] [CrossRef][Green Version]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).