Next Article in Journal
Empirical Likelihood Ratio Tests for Homogeneity of Multiple Populations in the Presence of Auxiliary Information
Previous Article in Journal
Special Issue “Recent Advances and Applications in Multi Criteria Decision Analysis”
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Novel Results for Two Generalized Classes of Fibonacci and Lucas Polynomials and Their Uses in the Reduction of Some Radicals

by
Waleed Mohamed Abd-Elhameed
1,*,
Andreas N. Philippou
2 and
Nasr Anwer Zeyada
1,3
1
Department of Mathematics, Faculty of Science, Cairo University, Giza 12613, Egypt
2
Department of Mathematics, University of Patras, 26504 Patras, Greece
3
Department of Mathematics, College of Science, University of Jeddah, Jeddah 23218, Saudi Arabia
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(13), 2342; https://doi.org/10.3390/math10132342
Submission received: 11 June 2022 / Revised: 28 June 2022 / Accepted: 29 June 2022 / Published: 4 July 2022

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 2 F 1 ( z ) 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.

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 k Fibonacci and k 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 { A i ( x ) } i 0 and { B j ( x ) } j 0 , then to solve the connection problem between them, we have to find the connection coefficients C i , j in the equation:
A i ( x ) = j = 0 i C i , j B j ( x ) .
The coefficients C i , j 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 2 F 1 ( z ) .
  • 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 a , b , r , and s be nonzero real numbers. Two classes generalizing Fibonacci and Lucas polynomials can be generated by means of the following two recurrence relations:
ϕ j a , b ( x ) = a x ϕ j 1 a , b ( x ) + b ϕ j 2 a , b ( x ) , ϕ 0 a , b ( x ) = 1 , ϕ 1 a , b ( x ) = a x , j 2 ,
and
ψ j r , s ( x ) = r x ψ j 1 r , s ( x ) + s ψ j 2 r , s ( x ) , ψ 0 r , s ( x ) = 2 , ψ 1 r , s ( x ) = r x , j 2 .
Note that for each j 0 , ϕ j a , b ( x ) and ψ j r , s ( x ) 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 ϕ j a , b ( x ) is given by [25],
ϕ j a , b ( x ) = a x + a 2 x 2 + 4 b j + 1 a x a 2 x 2 + 4 b j + 1 2 j + 1 a 2 x 2 + 4 b , j 0 ,
while Binet’s formulae for ψ j r , s ( x ) is given by [26],
ψ j r , s ( x ) = r x + r 2 x 2 + 4 s j + r x r 2 x 2 + 4 s j 2 j , j 0 .
Two of the most useful properties of the two polynomials ϕ j a , b ( x ) and ψ j r , s ( x ) are their power form representations. These expressions are given respectively in [25,26] in the following two combinatorial forms:
ϕ j a , b ( x ) = m = 0 j 2 j m m b m a j 2 m x j 2 m , j 0 ,
and
ψ j r , s ( x ) = j m = 0 j 2 s m r j 2 m j m m j m x j 2 m , j 1 .
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
ϕ j a , b ( x ) = b j / 2 ϕ j 1 , 1 a x b , j 0 ,
and
ψ j r , s ( x ) = s j / 2 ψ j 1 , 1 r x s , j 1 .
The inversion formulae of (6) and (7) are also of interest. The authors in [25] found the inversion formula of ϕ j a , b ( x ) in the form
x j = a j i = 0 j 2 ( b ) i j i ( j 2 i + 1 ) j i + 1 ϕ j 2 i a , b ( x ) , j 0 ,
while the same authors proved in [26] that the inversion of ψ j r , s ( x ) can be expressed as:
x j = r j i = 0 j 2 ( s ) i c j 2 i j i ψ j 2 i r , s ( x ) , j 0 ,
where
c j = 1 2 , j = 1 , 1 , j 1 .
The fundamental benefit of making use of the two generalized polynomials ϕ j a , b ( x ) and ψ j r , s ( x ) 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 ϕ j a , b ( x ) , while Lucas, Pell–Lucas, Fermat–Lucas, Chebyshev, and Dickson polynomials of the first kind are special polynomials of ψ j r , s ( x ) . Table 1 displays the different celebrated special classes of the two generalized classes of polynomials.

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 2 F 1 ( z ) for certain z.
In this instance, we refer to the definition of the hypergeometric function 2 F 1 ( z ) (see [19]),
2 F 1 a 1 , a 2 b 1 z = r = 0 ( a 1 ) r ( a 2 ) r ( b 1 ) r z r r ! ,
where a 1 , a 2 , and b 1 are complex or real parameters, with b 1 not zero nor a negative integer.
Now, the following lemma is needed.
Lemma 1.
Let a , b , r , and s be any nonzero real numbers and let
A m , i = i s m r a i 2 m i m m i m 2 F 1 m , i m i 2 m + 2 b r 2 a 2 s .
A m , i fulfills the following recurrence relation:
r A m , i 1 r b A m 1 , i 1 + a s A m 1 , i 2 = a A m , i .
Proof. 
Lemma 1 can be proved via straightforward lengthy computations in view of the definition of the hypergeometric function 2 F 1 ( z ) . □
Theorem 1.
The following connection formula applies for any non-negative integer i:
ϕ i a , b ( x ) = a r i m = 0 i 2 c i 2 m ( s ) m i m 2 F 1 m , m i i b r 2 a 2 s ψ i 2 m r , s ( x ) ,
where the numbers c j are those given in Equation (9).
Theorem 2.
The following connection formula applies for any non-negative integer i with i 1 :
ψ i r , s ( x ) = i m = 0 i 2 s m r a i 2 m i m m ( i m ) 2 F 1 m , i m i 2 m + 2 b r 2 a 2 s ϕ i 2 m a , b ( x ) .
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 i = 1 , it is easy to see that each of the two sides in (11) is equal to ( r x ) . Now, assume that (11) holds for all j < i , 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
ψ i a , b ( x ) = r x m = 0 i 1 2 A m , i 1 ϕ i 2 m 1 a , b ( x ) + s m = 0 i 2 1 A m , i 2 ϕ i 2 m 2 a , b ( x ) ,
where
A m , i = i s m r a i 2 m i m m i m 2 F 1 m , i m i 2 m + 2 b r 2 a 2 s .
The recurrence relation in (2) implies that
x ϕ i 2 m 1 a , b ( x ) = 1 a ϕ i 2 m a , b ( x ) b a ϕ i 2 m 2 a , b ( x ) .
If we insert (13) into (12), then the following relation is obtained:
ψ i a , b ( x ) = r a m = 0 i 1 2 A m , i 1 ϕ i 2 m a , b ( x ) r b a m = 0 i 1 2 A m , i 1 ϕ i 2 m 2 a , b ( x ) + s m = 0 i 2 1 A m , i 2 ϕ i 2 m 2 a , b ( x ) .
After some algebraic calculations, the last relation can be transformed into the equivalent one:
ψ i a , b ( x ) = m = 1 i 1 2 r a A m , i 1 r b a A m 1 , i 1 + s A m 1 , i 2 ϕ i 2 m a , b ( x ) + r a A 0 , i 1 ϕ i a , b ( x ) r b a A i 1 2 , i 1 ϕ i 2 i 1 2 2 a , b ( x ) + s A i 2 1 , i 2 ξ i ,
where
ξ i = 1 , i even , 0 , i odd .
In virtue of Lemma 1, one can rewrite (14) in the form
ψ i a , b ( x ) = m = 1 i 1 2 A m , i ϕ i 2 m a , b ( x ) + r a A 0 , i 1 ϕ i a , b ( x ) r b a A i 1 2 , i 1 ϕ i 2 i 1 2 2 a , b ( x ) + s A i 2 1 , i 2 ξ i .
It is not difficult to see that (15) can be written alternatively as
ψ i r , s ( x ) = i m = 0 i 2 s m r a i 2 m i m m i m 2 F 1 m , i m i 2 m + 2 b r 2 a 2 s ϕ i 2 m a , b ( x ) .
The proof of Theorem 2 is now complete. □
Next, we give a special case of Formula (10).
Corollary 1.
For r = a , s = b , the connection formula in (10) reduces to the following one:
ϕ i a , b ( x ) = m = 0 i 2 c i 2 m ( b ) m ψ i 2 m a , b ( x ) .
Proof. 
The substitution by r = a and s = b into Relation (10) yields the following relation:
ϕ i a , b ( x ) = m = 0 i 2 c i 2 m ( b ) m i m 2 F 1 m , m i i 1 ψ i 2 m r , s ( x ) .
With the aid of the Chu–Vandermond identity, it is easy to see that
2 F 1 m , m i i 1 = 1 i m ,
and consequently, Formula (16) can be easily obtained. □
Taking into consideration the special polynomials of the two classes ϕ j a , b ( x ) and ψ j r , s ( x ) 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:
F i + 1 ( x ) = m = 0 i 2 c i 2 m ( 1 ) m L i 2 m ( x ) ,
P i + 1 ( x ) = m = 0 i 2 c i 2 m ( 1 ) m Q i 2 m ( x ) ,
F i + 1 ( x ) = m = 0 i 2 c i 2 m 2 m f i 2 m ( x ) ,
U i ( x ) = 2 m = 0 i 2 c i 2 m T i 2 m ( x ) ,
E i + 1 α ( x ) = m = 0 i 2 c i 2 m α m D i 2 m α ( x ) .
Remark 1.
The connection formula in (17) can be translated to the following trigonometric identity:
2 sin θ m = 0 i 2 c i 2 m cos ( i 2 m ) θ = sin ( i + 1 ) θ .
Corollary 3.
For r = a and s = b , the connection formula in (11) reduces to the following connection formula:
ψ i a , b ( x ) = ϕ i a , b ( x ) + b ϕ i 2 a , b ( x ) .
Proof. 
The substitution of r = 1 and b = s into Relation (11) yields the following relation:
ψ i a , b ( x ) = i m = 0 i 2 b m i m m i m 2 F 1 m , i m i 2 m + 2 1 ϕ i 2 m a , b ( x ) .
Noting that
2 F 1 m , i m i 2 m + 2 1 = 1 , m = 0 , 1 i , m = 1 , 0 , otherwise ,
it is easy to see that Formula (19) reduces to
ψ i a , b ( x ) = ϕ i a , b ( x ) + b ϕ i 2 a , b ( x ) .
Taking into consideration the special polynomials of the two classes ϕ j a , b ( x ) and ψ j r , s ( x ) , several simple connection formulae can be deduced as special cases of Relation (18).
Corollary 4.
For every non-negative integer i with i 1 , the following connection formulae hold:
L i ( x ) = F i + 1 ( x ) + F i 1 ( x ) , Q i ( x ) = P i + 1 ( x ) + P i 1 ( x ) , f i ( x ) = F i + 1 2 F i 1 ( x ) , 2 T i ( x ) = U i ( x ) U i 2 ( x ) , D i α ( x ) = E i α ( x ) α E i 2 α ( x ) .

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 2 F 1 ( z ) for a certain z.
Theorem 3.
The following connection formula applies for every non-negative integer i:
ϕ i a , b ( x ) = a r i m = 0 i 2 ( s ) m i m ( i 2 m + 1 ) i m + 1 2 F 1 m , i + m 1 i b r 2 a 2 s ϕ i 2 m r , s ( x ) .
Theorem 4.
The following formula applies for every non-negative integer i:
ψ i a , b ( x ) = a r i m = 0 i 2 c i 2 m ( s ) m i m 2 F 1 m , m i 1 i b r 2 a 2 s ψ i 2 m r , s ( x ) ,
where the constants c j 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 ϕ i a , b ( x ) and ψ i a , b ( x ) , i 0 , and their inversion formulae. Now, we are going to prove Theorem 3. Making use of the analytic form of ϕ i a , b ( x ) in (6) enables one to write
ϕ i a , b ( x ) = r = 0 i 2 b r a i 2 r i r r x i 2 r ,
Expressing the term x i 2 r that appears in (22) in terms of the polynomials ϕ j r , s ( x ) using the inversion formula in (8) leads to the following formula:
ϕ i a , b ( x ) = r = 0 i 2 b r i r r a r i 2 r = 0 i 2 r ( s ) ( i 2 2 r + 1 ) i 2 r i 2 r + 1 ϕ i 2 2 r r , s ( x ) .
Rearranging the right-hand side of the last relation and performing some lengthy manipulations enables one to obtain the following relation:
ϕ i a , b ( x ) = m = 0 i 2 ( 2 m i 1 ) ϕ i 2 m r , s ( x ) r = 0 m ( 1 ) m + r b r a r i 2 r s m r i r r i 2 r m r m i + r 1 .
It is not difficult to see that
r = 0 m ( 1 ) m + r b r a r i 2 r s m r i r r i 2 r m r m i + r 1 = ( 1 ) m + 1 s m a r i i m i m + 1 2 F 1 m , i + m 1 i b r 2 a 2 s ,
and consequently, Relation (23) yields the connection formula
ϕ i a , b ( x ) = a r i m = 0 i 2 ( s ) m i m ( i 2 m + 1 ) i m + 1 2 F 1 m , i + m 1 i b r 2 a 2 s ϕ i 2 m r , s ( x ) .
Remark 2.
Several connection formulae can be deduced as special cases of the two connection formulae in (20) and (21). In fact, there are forty relations that can be obtained. In the following, we give some of these formulae.
Corollary 5.
If we set r = 2 and s = 1 in Relation (20), then we obtain
ϕ i a , b ( x ) = a 2 i m = 0 i 2 i m ( i 2 m + 1 ) i m + 1 2 F 1 m , i + m 1 i 4 b a 2 U i 2 m ( x ) .
Corollary 6.
If we set a = 2 and b = 1 in Relation (20), then we obtain
U i ( x ) = 2 r i m = 0 i 2 ( s ) m i m ( i 2 m + 1 ) i m + 1 2 F 1 m , i + m 1 i r 2 4 s ϕ i 2 m r , s ( x ) .
In particular, and if we set a = b = 1 in (24) and r = s = 1 in (25), then the following two relations are obtained:
F i + 1 ( x ) = 1 2 i m = 0 i 2 i m ( i 2 m + 1 ) i m + 1 2 F 1 m , i + m 1 i 4 U i 2 m ( x ) ,
and
U i ( x ) = 2 i m = 0 i 2 ( 1 ) m i m ( i 2 m + 1 ) i m + 1 2 F 1 m , i + m 1 i 1 4 F i 2 m + 1 ( x ) .
Remark 3.
The two relations in (26) and (27) are in agreement with those developed in [16].
Corollary 7.
If we set r = 2 and s = 1 in (21), then we obtain
ψ i a , b ( x ) = 2 a 2 i m = 0 i 2 c i 2 m i m 2 F 1 m , m i 1 i 4 b a 2 T i 2 m ( x ) .

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 { F i } i 0 , { P i } i 0 , { F i } i 0 , { L i } i 0 , { Q i } i 0 , and { f i } i 0 defined in Table 1, there are thirty relations linking them. All the coefficients between them involve 2 F 1 ( z ) for a certain z. In six cases only, the appearing 2 F 1 ( z ) can be summed. They are given explicitly in the following corollary.
Corollary 8.
For every non-negative integer i, the following identities are valid:
F i + 1 = m = 0 i 2 c i 2 m ( 1 ) m L i 2 m , P i + 1 = m = 0 i 2 c i 2 m ( 1 ) m Q i 2 m , F i + 1 = m = 0 i 2 c i 2 m 2 m f i 2 m , L i = F i + 1 + F i 1 , Q i = P i + 1 + P i 1 , f i = F i + 1 2 F i 1 .
Now, with respect to the remaining twenty-four relations among the celebrated sequences of numbers, they can be deduced easily by setting x = 1 in the relations of Theorems 1–4, taking into consideration the different special cases of the two generalized polynomials { ϕ i a , b ( x ) } i 0 and { ψ i a , b ( x ) } i 0 .

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 2 F 1 ( z ) . Some of these results are given in the following two corollaries.
Corollary 9.
For all non-negative integers i , j with j i , the following two integral formulae hold:
1 1 1 1 x 2 ϕ i a , b ( x ) T j ( x ) d x = π a 2 i ( 1 ) i + j i i j 2 2 F 1 i + j 2 j i 2 i 4 b a 2 , if   ( i + j ) even , 0 , otherwise ,
and
1 1 1 x 2 ψ i r , s ( x ) U j ( x ) d x = π i r 2 j i + j 2 i j 2 s i j 2 i + j 2 F 1 j i 2 , i + j 2 j + 2 r 2 4 s , if   ( i + j ) even , 0 , otherwise .
Proof. 
If we set r = 2 and s = 1 in Relation (10), then after making use of the orthogonality relation of T j ( x ) , Relation (28) can be obtained. Relation (29) can be obtained by setting a = 2 and b = 1 in Relation (11) and making use of the orthogonality relation of U j ( x ) . □

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:
( a 2 x 2 + 4 b ) ϕ k 1 a , b ( x ) 2 ψ k a , b ( x ) 2 = 4 ( 1 ) k + 1 b k .
Proof. 
The two Binet’s formulae in (4) and (5) can be rewritten in the form
ϕ k 1 a , b ( x ) = α ( x ) k β ( x ) k α ( x ) β ( x ) ,
and
ψ k a , b ( x ) = α ( x ) k + β ( x ) k ,
where
α ( x ) = a x + a 2 x 2 + 4 b 2 , β ( x ) = a x a 2 x 2 + 4 b 2 ,
and consequently, we have
( a 2 x 2 + 4 b ) ϕ k 1 a , b ( x ) 2 ψ k a , b ( x ) 2 = ( α ( x ) ) k ( β ( x ) ) k 2 ( α ( x ) ) k + ( β ( x ) ) k 2 = 4 α ( x ) β ( x ) k = 4 ( 1 ) k + 1 b k .
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 x R such that ( a x ) 2 4 b , the following two identities hold:
ψ k a , b ( x ) 2 + ψ k a , b ( x ) 2 4 + b k k + ψ k a , b ( x ) 2 ψ k a , b ( x ) 2 4 + b k k = a x ,
and
ψ k a , b ( x ) 2 + ψ k a , b ( x ) 2 4 + b k k ψ k a , b ( x ) 2 ψ k a , b ( x ) 2 4 + b k k = a 2 x 2 + 4 b .
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
α ( x ) + β ( x ) = a x ,
α ( x ) β ( x ) = a 2 x 2 + 4 b .
Inserting the identity in (37) into Relation (31), the following relation is obtained:
a 2 x 2 + 4 b ϕ k 1 a , b ( x ) = α ( x ) k β ( x ) k .
Now, the last relation along with Relation (32) yields the following two relations:
α ( x ) k = 1 2 ψ k a , b ( x ) + a 2 x 2 + 4 b ϕ k 1 a , b ( x ) ,
and
β ( x ) k = 1 2 ψ k a , b ( x ) a 2 x 2 + 4 b ϕ k 1 a , b ( x ) .
Next, and based on the identity in (30), Relations (38) and (39) can be written alternatively as
α ( x ) k = 1 2 ψ k a , b ( x ) + ψ k a , b ( x ) 2 + 4 b k ,
and
β ( x ) k = 1 2 ψ k a , b ( x ) ψ k a , b ( x ) 2 + 4 b k .
Finally, we observe that the last two relations lead to the following interesting identity,
ψ k a , b ( x ) 2 + ψ k a , b ( x ) 2 4 + b k k ± ψ k a , b ( x ) 2 ψ k a , b ( x ) 2 4 + b k k = α ( x ) ± β ( x ) ,
which can be split using Relations (36) and (37) to give the two identities in (34) and (35). This proves Theorem 5. □
Corollary 10.
Let k be any positive odd integer. Then for nonzero real numbers a and b with b 1 / 4 , there are infinite numbers of expressions of unit radicals in the sense that
ψ k a , b ( 1 a ) 2 + ψ k a , b ( 1 a ) 2 4 + b k k + ψ k a , b ( 1 a ) 2 ψ k a , b ( 1 a ) 2 4 + b k k = 1 .
Proof. 
Setting x = 1 a in (34) yields Formula (40). □
As a consequence of Theorem 5 and taking into consideration the special polynomials of ψ i a , b ( x ) 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 x R , one has
L 2 i + 1 x 2 + L 2 i + 1 2 x 4 + 1 2 i + 1 + L 2 i + 1 x 2 L 2 i + 1 2 x 4 + 1 2 i + 1 = x , L 2 i + 1 x 2 + L 2 i + 1 2 x 4 + 1 2 i + 1 L 2 i + 1 x 2 L 2 i + 1 2 x 4 + 1 2 i + 1 = x 2 + 4 .
2. 
For all x R , one has
Q 2 i + 1 x 2 + Q 2 i + 1 2 x 4 + 1 2 i + 1 + Q 2 i + 1 x 2 Q 2 i + 1 2 x 4 + 1 2 i + 1 = 2 x , Q 2 i + 1 x 2 + Q 2 i + 1 2 x 4 + 1 2 i + 1 Q 2 i + 1 x 2 Q 2 i + 1 2 x 4 + 1 2 i + 1 = 2 x 2 + 1 .
3. 
For all x R \ ( 2 2 3 , 2 2 3 ) , one has
f 2 i + 1 x 2 + f 2 i + 1 2 x 4 2 2 i + 1 2 i + 1 + f 2 i + 1 x 2 f 2 i + 1 2 x 4 2 2 i + 1 2 i + 1 = 3 x , f 2 i + 1 x 2 + f 2 i + 1 2 x 4 2 2 i + 1 2 i + 1 f 2 i + 1 x 2 f 2 i + 1 2 x 4 2 2 i + 1 2 i + 1 = 9 x 2 8 .
4. 
For all x R \ ( 1 , 1 ) , one has
T 2 i + 1 x + T 2 i + 1 2 x 1 2 i + 1 + T 2 i + 1 x T 2 i + 1 2 x 1 2 i + 1 = 2 x , T 2 i + 1 x + T 2 i + 1 2 x 1 2 i + 1 T 2 i + 1 x T 2 i + 1 2 x 1 2 i + 1 = 2 x 2 1 .
5. 
Either for all x R whenever α < 0 or for all x R \ ( 2 α , 2 α ) whenever α > 0 , one has
D 2 i + 1 α x 2 + ( D 2 i + 1 α x ) 2 4 α 2 i + 1 2 i + 1 + D 2 i + 1 α x 2 ( D 2 i + 1 α x ) 2 4 α 2 i + 1 2 i + 1 = x , D 2 i + 1 α x 2 + ( D 2 i + 1 α x ) 2 4 α 2 i + 1 2 i + 1 D 2 i + 1 α x 2 ( D 2 i + 1 α x ) 2 4 α 2 i + 1 2 i + 1 = x 2 4 α .
If we put x = 1 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
L 2 i + 1 2 + L 2 i + 1 2 4 + 1 2 i + 1 + L 2 i + 1 2 L 2 i + 1 2 4 + 1 2 i + 1 = 1 , L 2 i + 1 2 + L 2 i + 1 2 4 + 1 2 i + 1 L 2 i + 1 2 L 2 i + 1 2 4 + 1 2 i + 1 = 5 , Q 2 i + 1 2 + Q 2 i + 1 2 4 + 1 2 i + 1 + Q 2 i + 1 2 Q 2 i + 1 2 4 + 1 2 i + 1 = 2 , Q 2 i + 1 2 + Q 2 i + 1 2 4 + 1 2 i + 1 Q 2 i + 1 2 Q 2 i + 1 2 4 + 1 2 i + 1 = 2 2 , f 2 i + 1 2 + f 2 i + 1 2 4 2 2 i + 1 2 i + 1 + f 2 i + 1 2 f 2 i + 1 2 4 2 2 i + 1 2 i + 1 = 3 , f 2 i + 1 2 + f 2 i + 1 2 4 2 2 i + 1 2 i + 1 f 2 i + 1 2 f 2 i + 1 2 4 2 2 i + 1 2 i + 1 = 1 .
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. 
7 + 5 2 3 + 7 5 2 3 = L 3 ( 2 ) 2 + ( L 3 ( 2 ) ) 2 4 + 1 3 + L 3 ( 2 ) 2 ( L 3 ( 2 ) ) 2 4 + 1 3 = 2 .
2. 
7 + 5 2 3 7 5 2 3 = L 3 ( 2 ) 2 + ( L 3 ( 2 ) ) 2 4 + 1 3 L 3 ( 2 ) 2 ( L 3 ( 2 ) ) 2 4 + 1 3 = 2 2 .
3. 
117 + 37 10 3 + 117 37 10 3 = Q 3 ( 3 ) 2 + ( Q 3 ( 3 ) ) 2 4 + 1 3 + Q 3 ( 3 ) 2 ( Q 3 ( 3 ) ) 2 4 + 1 3 = 6 .
4. 
115896 + 19876 34 5 + 115896 19876 34 5 = f 5 ( 4 ) 2 + ( f 5 ( 4 ) ) 2 4 2 5 5 + f 5 ( 4 ) 2 ( f 5 ( 4 ) ) 2 4 2 5 5 = 12 .
5. 
47525 + 19402 6 5 + 47525 19402 6 5 = T 5 ( 5 ) + ( T 5 ( 5 ) ) 2 1 5 + T 5 ( 5 ) ( T 5 ( 5 ) ) 2 1 5 = 10 .

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 ( a x ) 2 4 b , the following two identities hold:
ψ k a , b ( x ) 2 + ψ k a , b ( x ) 2 4 b k k ψ k a , b ( x ) 2 ψ k a , b ( x ) 2 4 b k k = a x , b > 0 , a 2 x 2 + 4 b , b < 0 ,
and
ψ k a , b ( x ) 2 + ψ k a , b ( x ) 2 4 b k k + ψ k a , b ( x ) 2 ψ k a , b ( x ) 2 4 b k k = a 2 x 2 + 4 b , b > 0 , a x , b < 0 .
Proof. 
Let k be a positive even integer. In view of Equation (4), for all real numbers x with ( a x ) 2 4 b , ϕ k 1 a , b ( x ) 0 if and only if a x 0 .
Now, Equation (30) may be written as a 2 x 2 + 4 b ϕ k 1   =   ψ k 2 4 b k . Using similar procedures followed in the proof of Theorem 5 leads to the following identity,
ψ k a , b ( x ) 2 + ψ k a , b ( x ) 2 4 b k k ψ k a , b ( x ) 2 ψ k a , b ( x ) 2 4 b k k = | α ( x ) β ( x ) | ,
and consequently, the identities in (41) and (42) can be obtained. □
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 x R , one has
L 2 i x 2 + L 2 i 2 x 4 1 2 i L 2 i x 2 L 2 i 2 x 4 1 2 i = x , L 2 i x 2 + L 2 i 2 x 4 1 2 i + L 2 i x 2 L 2 i 2 x 4 1 2 i = x 2 + 4 .
2. 
For all x R , one has
Q 2 i x 2 + Q 2 i 2 x 4 1 2 i Q 2 i x 2 Q 2 i 2 x 4 1 2 i = 2 | x | , Q 2 i x 2 + Q 2 i 2 x 4 1 2 i + Q 2 i x 2 Q 2 i 2 x 4 1 2 i = 2 x 2 + 1 .
3. 
For all x R \ ( 2 2 3 , 2 2 3 ) , one has
f 2 i x 2 + f 2 i 2 x 4 2 2 i 2 i f 2 i x 2 f 2 i 2 x 4 2 2 i 2 i = 9 x 2 8 , f 2 i x 2 + f 2 i 2 x 4 2 2 i 2 i + f 2 i x 2 f 2 i 2 x 4 2 2 i 2 i = 3 | x | .
4. 
For all x R \ ( 1 , 1 ) , one has
T 2 i x + T 2 i 2 x 1 2 i T 2 i x + T 2 i 2 x 1 2 i = 2 x 2 1 , T 2 i x + T 2 i 2 x 1 2 i + T 2 i x + T 2 i 2 x 1 2 i = 2 | x | .
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. 
17 + 12 2 4 17 12 2 4 = L 4 ( 2 ) 2 + ( L 4 ( 2 ) ) 2 4 1 4 L 4 ( 2 ) 2 ( L 4 ( 2 ) ) 2 4 1 4 = 2 .
2. 
5201 + 1020 26 4 5201 1020 26 4 = Q 4 ( 5 ) 2 + ( Q 4 ( 5 ) ) 2 4 1 4 Q 4 ( 5 ) 2 ( Q 4 ( 5 ) ) 2 4 1 4 = 10 .
3. 
83448209 2 + 4010265 2 433 6 + 83448209 2 4010265 2 433 6 = f 6 ( 7 ) 2 + ( f 6 ( 7 ) ) 2 4 2 6 6 + f 6 ( 7 ) 2 ( f 6 ( 7 ) ) 2 4 2 6 6 = 21 .
4. 
708158977 + 408855776 3 8 + 708158977 408855776 3 8 = T 8 ( 7 ) + ( T 8 ( 7 ) ) 2 1 8 + T 8 ( 7 ) ( T 8 ( 7 ) ) 2 1 8 = 14 .

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 x R * , one has
ψ j a , b 1 a ( x b x ) = x j b j x j , j odd , x j + b j x j , j even .
Proof. 
Binet’s formula in (5) implies that
ψ j a , b 1 a ( x b x ) = 1 2 j x b x + x b x 2 + 4 b j + ( x b x ) ( x b x ) 2 + 4 b j = 1 2 j ( x b x ) + ( x + b x ) 2 j + ( x b x ) ( x + b x ) 2 j = 1 2 j x b x + x + b x j + ( x b x ) x + b x j = 1 2 j ( 2 x ) j + 2 b x j = x j b j x j , j odd , x j + b j x j , j even .
The proof is now complete. □
Theorem 7.
If j is an odd positive integer and b R , then for every x R * , the following identity applies:
ψ j a , b ( 1 a ( x b x ) ) 2 + ψ j a , b ( 1 a ( x b x ) ) 2 4 + b j j = x , x > 0 , b > 0 , b x , x < 0 , b > 0 , x , x [ b , 0 ) [ b , ) , b < 0 , b x , x ( , b ) ( 0 , b ) , b < 0 .
Proof. 
From Lemma 3, we have
ψ j a , b ( 1 a ( x b x ) ) 2 + ψ j a , b ( 1 a ( x b x ) ) 2 4 + b j j = ( x j b j x j ) 2 + ( x j b j x j ) 2 4 + b j j
= ( x j b j x j ) 2 + ( x j + b j x j ) 2 4 j = ( x j b j x j ) 2 + | x j + b j x j | 2 j ,
and consequently, Relation (43) can be obtained. □
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:
L j ( x 1 x ) 2 + L j ( x 1 x ) 2 4 + 1 j = x , x > 0 , 1 x , x < 0 , Q j ( 1 2 ( x 1 x ) ) 2 + Q j ( 1 2 ( x 1 x ) ) 2 4 + 1 j = x , x > 0 , 1 x , x < 0 , f j ( 1 3 ( x + 2 x ) ) 2 + f j ( 1 3 ( x + 2 x ) ) 2 4 2 j j = x , x [ 2 , ) [ 2 , 0 ) , 2 x , x ( , 2 ) ( 0 , 2 ) , T j ( 1 2 ( x + 1 x ) ) + T j ( 1 2 ( x + 1 x ) ) 2 1 j = x , x [ 1 , ) [ 1 , 0 ) , 1 x , x ( , 1 ) ( 0 , 1 ) .
Example 3.
As an application of Corollary 14, which is a corollary of Theorem 7, we readily get (for j = 5 and x = 1 3 ) the following odd reduction formula:
1889569 486 + 3570463447489 236196 5 = f 5 ( 19 9 ) 2 + ( f 5 ( 19 9 ) ) 2 4 32 5 = 1 3 .
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:
ψ j a , b ( 1 a ( x b x ) ) 2 + ψ j a , b ( 1 a ( x b x ) ) 2 4 b j j = | x | , x R \ ( | b | , | b | ) , | b x | , x ( | b | , | b | ) .
Example 4.
The dedication for Paper [31] reads: "In memory of Ramanujan on the
32 ( 146410001 48400 ) 3 6 ( 146410001 48400 ) + ( 32 ( 146410001 48400 ) 3 6 ( 146410001 48400 ) ) 2 1 6 t h
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
32 146410001 48400 3 6 146410001 48400 = 1 2 ψ 3 1 , 1 ( 110 ) 2 + 1 ( 110 ) 2 ,
then we have
32 ( 146410001 48400 ) 3 6 ( 146410001 48400 ) + ( 32 ( 146410001 48400 ) 3 6 ( 146410001 48400 ) ) 2 1 6 = ψ 3 1 , 1 ( 110 ) 2 + 1 ( 110 ) 2 2 + ψ 3 1 , 1 ( 110 ) 2 + 1 ( 110 ) 2 2 4 1 6 = ( 110 ) 2 = 110 .

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

  1. Zhang, W. On Chebyshev polynomials and Fibonacci numbers. Fibonacci Quart. 2002, 40, 424–428. [Google Scholar]
  2. 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]
  3. Koshy, T. Fibonacci and Lucas Numbers with Applications, Volume 2; John Wiley & Sons: Hoboken, NJ, USA, 2019. [Google Scholar]
  4. Djordjevic, G.B.; Milovanovic, G.V. Special Classes of Polynomials; University of Nis, Faculty of Technology Leskovac: Niš, Serbia, 2014. [Google Scholar]
  5. Falcon, F.; Plaza, A. On the Fibonacci k-numbers. Chaos Soliton Fract. 2007, 32, 1615–1624. [Google Scholar] [CrossRef]
  6. 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]
  7. Horadam, A.F. Basic properties of a certain generalized sequence of numbers. Fibonacci Quart. 1965, 3, 161–176. [Google Scholar]
  8. 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]
  9. Yayenie, O. A note on generalized Fibonacci sequences. Appl. Math. Comput. 2011, 217, 5603–5611. [Google Scholar] [CrossRef]
  10. Bednarz, U.; Wołowiec-Musiał, M. Distance Fibonacci Polynomials. Symmetry 2020, 12, 1540. [Google Scholar] [CrossRef]
  11. 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]
  12. Dilcher, K.; Pisano, L. Hypergeometric functions and Fibonacci numbers. Fibonacci Q. 2000, 38, 342–362. [Google Scholar]
  13. 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]
  14. Muskat, J.B. Generalized Fibonacci and Lucas sequences and rootfinding methods. Math. Comp. 1993, 61, 365–372. [Google Scholar] [CrossRef]
  15. 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]
  16. 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] [Green Version]
  17. 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]
  18. 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]
  19. Andrews, G.E.; Askey, R.; Roy, R. Special Functions; Number 71; Cambridge University Press: Cambridge, UK, 1999. [Google Scholar]
  20. Rainville, E.D. Special Functions; The Maximalan Company: New York, NY, USA, 1960. [Google Scholar]
  21. Tcheutia, D.D. On Connection, Linearization and Duplication Coefficients of Classical Orthogonal Polynomials. Ph.D. Thesis, Universität Kassel, Kassel, Germany, 2014. [Google Scholar]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. Landau, S. Simplification of nested radicals. SIAM J. Sci. Comput. 1992, 21, 85–110. [Google Scholar] [CrossRef]
  30. Osler, T.J. Cardan polynomials and the reduction of radicals. Math. Mag. 2001, 74, 26–32. [Google Scholar] [CrossRef]
  31. 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]
  32. 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]
Table 1. Special cases of the two generalizing classes.
Table 1. Special cases of the two generalizing classes.
Fibonacci polynomials F j + 1 ( x ) = ϕ j 1 , 1 ( x )
Pell polynomials P j + 1 ( x ) = ϕ j 2 , 1 ( x )
Fermat polynomials F j + 1 ( x ) = ϕ j 3 , 2 ( x )
Chebyshev polynomials of second kind U j ( x ) = ϕ j 2 , 1 ( x )
Dickson polynomials of second kind E j α ( x ) = ϕ j 1 , α ( x )
Lucas polynomials L j ( x ) = ψ j 1 , 1 ( x )
Pell–Lucas polynomials Q j ( x ) = ψ j 2 , 1 ( x )
Fermat–Lucas polynomials f j ( x ) = ψ j 3 , 2 ( x )
Chebyshev polynomials of first kind T j ( x ) = 1 2 ψ j 2 , 1 ( x )
Dickson polynomials of first kind D j α ( x ) = ψ j 1 , α ( x )
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Abd-Elhameed, W.M.; Philippou, A.N.; Zeyada, N.A. Novel Results for Two Generalized Classes of Fibonacci and Lucas Polynomials and Their Uses in the Reduction of Some Radicals. Mathematics 2022, 10, 2342. https://doi.org/10.3390/math10132342

AMA Style

Abd-Elhameed WM, Philippou AN, Zeyada NA. Novel Results for Two Generalized Classes of Fibonacci and Lucas Polynomials and Their Uses in the Reduction of Some Radicals. Mathematics. 2022; 10(13):2342. https://doi.org/10.3390/math10132342

Chicago/Turabian Style

Abd-Elhameed, Waleed Mohamed, Andreas N. Philippou, and Nasr Anwer Zeyada. 2022. "Novel Results for Two Generalized Classes of Fibonacci and Lucas Polynomials and Their Uses in the Reduction of Some Radicals" Mathematics 10, no. 13: 2342. https://doi.org/10.3390/math10132342

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