Next Article in Journal
CSE_E 1.0: An Integrated Automated Theorem Prover for First-Order Logic
Next Article in Special Issue
Some Identities and Inequalities Involving Symmetry Sums of Legendre Polynomials
Previous Article in Journal
Design of Short-Turning Service for a Bus Route with Hybrid Vehicle Type
Previous Article in Special Issue
Note on Type 2 Degenerate q-Bernoulli Polynomials
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A New Identity Involving Balancing Polynomials and Balancing Numbers

School of Mathematics, Northwest University, Xi’an 710127, Shaanxi, China
Symmetry 2019, 11(9), 1141; https://doi.org/10.3390/sym11091141
Submission received: 13 August 2019 / Accepted: 5 September 2019 / Published: 7 September 2019
(This article belongs to the Special Issue Current Trends in Symmetric Polynomials with Their Applications Ⅱ)

Abstract

:
In this paper, a second-order nonlinear recursive sequence M ( h , i ) is studied. By using this sequence, the properties of the power series, and the combinatorial methods, some interesting symmetry identities of the structural properties of balancing numbers and balancing polynomials are deduced.

1. Introduction

For any positive integer n 2 , we denote the balancing number by B n and the balancer corresponding to it by r ( n ) if
1 + 2 + + ( B n 1 ) = ( B n + 1 ) + ( B n + 2 ) + + B n + r ( n )
holds for some positive integer r ( n ) and B n . It is clear that r ( n ) = B n B n 1 1 2 , for example, r ( 2 ) = 2 , r ( 3 ) = 14 , r ( 4 ) = 84 , r ( 5 ) = 492
It is found that the balancing numbers satisfy the second order linear recursive sequence B n + 1 = 6 B n B n 1 ( n 1 ) , providing B 0 = 0 and B 1 = 1 [1].
The balancing polynomials B n ( x ) are defined by B 0 ( x ) = 1 , B 1 ( x ) = 6 x , B 2 ( x ) = 36 x 2 1 , B 3 ( x ) = 216 x 3 12 x , B 4 ( x ) = 1296 x 4 108 x 2 + 1 , and the second-order linear difference equation:
B n + 1 ( x ) = 6 x B n ( x ) B n 1 ( x ) , n 1 ,
where x is any real number. While n 1 , we get B n + 1 = 6 B n B n 1 with B n ( 1 ) = B n + 1 . Such balancing numbers have been widely studied in recent years. G. K. Panda and T. Komatsu [2] studied the reciprocal sums of the balancing numbers and proved the following inequation holds for any positive integer n:
1 B n B n 1 < k = n 1 B k < 1 B n B n 1 1 .
G. K. Panda [3] studied some fascinating properties of balancing numbers and gave the following result for any natural numbers m > n :
( B m + B n ) ( B m B n ) = B m + n · B m n .
Other achievements related to balancing numbers can be found in [4,5,6,7].
It is found that the balancing polynomials B n ( x ) can be generally expressed as
B n ( x ) = 1 2 9 x 2 1 3 x + 9 x 2 1 n + 1 3 x 9 x 2 1 n + 1 ,
and the generating function of the balancing polynomials B n ( x ) is given by
1 1 6 x t + t 2 = n = 0 B n ( x ) · t n .
Recently, our attention was drawn to the sums of polynomials calculating problem [8,9,10,11], which is important in mathematical application. We are going to study the computational problem of the symmetry summation:
a 1 + a 2 + + a h + 1 = n B a 1 ( x ) B a 2 ( x ) B a h + 1 ( x ) ,
where h is any positive integer. We shall prove the following theorem holds.
Theorem 1.
For any specific positive integer h and any integer n 0 , the following identity stands:
a 1 + a 2 + + a h + 1 = n B a 1 ( x ) B a 2 ( x ) B a h + 1 ( x ) = 1 2 h · h ! · j = 1 h M ( h , j ) ( 3 x ) 2 h j i = 0 n ( n i + j ) ! ( n i ) ! · B n i + j ( x ) ( 3 x ) i · 2 h + i j 1 i ,
where M ( h , i ) is defined by M ( h , 0 ) = 0 , M ( h , i ) = 2 h i 1 ! 2 h i · ( h i ) ! · ( i 1 ) ! for all positive integers 1 i h .
In particular, for n = 0 , the following corollary can be deduced.
Corollary 1.
For any positive integer h 1 , the following formula holds:
j = 1 h M ( h , j ) · j ! · ( 3 x ) j · B j ( x ) = 2 h · h ! · ( 3 x ) 2 h .
The formula in Corollary 1 shows the close relationship among the balancing polynomials. For h = 2 , the following corollary can be inferred by Theorem 1.
Corollary 2.
For any integer n 0 , we obtain
a + b + c = n B a ( x ) · B b ( x ) · B c ( x ) = 1 216 x 3 i = 0 n ( n i + 1 ) ( i + 1 ) ( i + 2 ) · B n i + 2 ( 3 x ) i + 1 72 x 2 i = 0 n ( n i + 1 ) ( n i + 2 ) ( i + 1 ) · B n i + 3 ( 3 x ) i .
For x = 1 , h = 2 a n d 3 , according to Theorem 1 we can also infer the following corollaries:
Corollary 3.
For any integer n 0 , we obtain
a + b + c = n B a + 1 · B b + 1 · B c + 1 = 1 216 i = 0 n ( n i + 1 ) ( i + 1 ) ( i + 2 ) · B n i + 2 3 i + 1 72 i = 0 n ( n i + 1 ) ( n i + 2 ) ( i + 1 ) · B n i + 3 3 i .
Corollary 4.
For any integer n 0 , we obtain:
a + b + c + d = n B a + 1 · B b + 1 · B c + 1 · B d + 1 = 1 3888 i = 0 n ( n i + 1 ) ( i + 1 ) ( i + 2 ) ( i + 3 ) ( i + 4 ) · B n i + 2 3 i + 1 1296 i = 0 n ( n i + 1 ) ( n i + 2 ) ( i + 1 ) ( i + 2 ) ( i + 3 ) · B n i + 3 3 i + 1 1296 i = 0 n ( n i + 1 ) ( n i + 2 ) ( n i + 3 ) ( i + 1 ) ( i + 2 ) · B n i + 4 3 i .
Corollary 5.
For any odd prime p, we have the congruence M ( p , i ) 0 ( m o d p ), 0 i p 1 .
Corollary 6.
The balancing polynomials are essentially Chebyshev polynomials of the second kind, specifically B n ( x ) = U n ( 3 x ) . Taking x = 1 3 x in Theorem 1, we can get the following:
a 1 + a 2 + + a h + 1 = n U a 1 ( x ) U a 2 ( x ) U a h + 1 ( x ) = 1 2 h · h ! · j = 1 h ( 2 h j 1 ) ! 2 h j · ( h j ) ! · ( j 1 ) ! · x 2 h j i = 0 n ( n i + j ) ! ( n i ) ! · U n i + j ( x ) x i · 2 h + i j 1 i .
Compared with [8], we give a more precise result for a 1 + a 2 + + a h + 1 = n U a 1 ( x ) U a 2 ( x ) U a h + 1 ( x ) with the specific expressions of M ( h , i ) . This shows our novelty.
Here, we list the first several terms of M ( h , i ) in Table 1 in order to demonstrate the properties of the sequence M ( h , i ) clearly.

2. Several Lemmas

For the sake of clarity, several lemmas that are necessary for proving our theorem will be given in this section.
Lemma 1.
For the sequence M ( n , i ) , the following identity holds for all 1 i n :
M ( n , i ) = ( 2 n i 1 ) ! 2 n i · ( n i ) ! · ( i 1 ) ! .
Proof. 
We present a straightforward proof of this lemma by using mathematical introduction. It is obvious that
M ( 1 , 1 ) = 0 ! 1 · 0 ! · 0 ! = 1 .
This means Lemma 1 is valid for n = 1 . Without loss of generality, we assume that Lemma 1 holds for 1 n = h and all 1 i h . Then, we have
M ( h , i ) = ( 2 h i 1 ) ! 2 h i · ( h i ) ! · ( i 1 ) ! ,
M ( h , i + 1 ) = ( 2 h i 2 ) ! 2 h i 1 · ( h i 1 ) ! · i ! .
According to the definitions of M ( n , i ) , it is easy to find that
M ( h + 1 , i + 1 ) = ( 2 h 1 i ) · M ( h , i + 1 ) + M ( h , i ) = ( 2 h 1 i ) · 2 ( h i ) ( 2 h i 1 ) i · M ( h , i ) + M ( h , i ) = 2 h i i M ( h , i ) = ( 2 h i ) ! 2 h i · ( h i ) ! · i ! = 2 ( h + 1 ) ( i + 1 ) 1 ! 2 h i · ( h i ) ! · i ! .
Thus, Lemma 1 is also valid for n = h + 1 . From now on, Lemma 1 has been proved. □
Lemma 2.
If we have a function f ( t ) = 1 1 6 x t + t 2 , then for any positive integer n, real numbers x and t with | t | < | 3 x | , the following identity holds:
2 n · n ! · f n + 1 ( t ) = i = 1 n M ( n , i ) · f ( i ) ( t ) ( 3 x t ) 2 n i ,
where f ( i ) ( t ) denotes the i-th order derivative of f ( t ) , with respect to variable t and M ( n , i ) , which is defined in the theorem.
Proof. 
Similarly, Lemma 2 will be proved by mathematical induction. We start by showing that Lemma 2 is valid for n = 1 . Using the properties of the derivative, we have:
f ( t ) = ( 6 x 2 t ) · f 2 ( t ) ,
or
2 f 2 ( t ) = f ( t ) 3 x t = M ( 1 , 1 ) · f ( t ) 3 x t .
This is in fact true and provides the main idea to show the following steps. Without loss of generality, we assume that Lemma 2 holds for 1 n = h . Then, we have
2 h · h ! · f h + 1 ( t ) = i = 1 h M ( h , i ) · f ( i ) ( t ) ( 3 x t ) 2 h i .
As an immediate consequence, we can tell by (2), the properties of M ( n , i ) , and the derivative, we get
2 h · ( h + 1 ) ! · f h ( t ) · f ( t ) = 2 h + 1 · ( h + 1 ) ! · ( 3 x t ) · f h + 2 ( t ) = i = 1 h M ( h , i ) ( 3 x t ) 2 h i · f ( i + 1 ) ( t ) + i = 1 h ( 2 h i ) M ( h , i ) ( 3 x t ) 2 h i + 1 · f ( i ) ( t ) = M ( h , h ) ( 3 x t ) h · f ( h + 1 ) ( t ) + i = 1 h 1 M ( h , i ) ( 3 x t ) 2 h i · f ( i + 1 ) ( t ) + ( 2 h 1 ) M ( h , 1 ) ( 3 x t ) 2 h · f ( t ) + i = 1 h 1 ( 2 h i 1 ) M ( h , i + 1 ) ( 3 x t ) 2 h i · f ( i + 1 ) ( t ) = M ( h + 1 , h + 1 ) ( 3 x t ) h · f ( h + 1 ) ( t ) + M ( h + 1 , 1 ) ( 3 x t ) 2 h · f ( t ) + i = 1 h 1 M ( h + 1 , i + 1 ) ( 3 x t ) 2 h i · f ( i + 1 ) ( t ) = M ( h + 1 , h + 1 ) ( 3 x t ) h · f ( h + 1 ) ( t ) + M ( h + 1 , 1 ) ( 3 x t ) 2 h · f ( t ) + i = 2 h M ( h + 1 , i ) ( 3 x t ) 2 h + 1 i · f ( i ) ( t ) = i = 1 h + 1 M ( h + 1 , i ) · f ( i ) ( t ) ( 3 x t ) 2 h + 1 i .
Then, it is deduced that
2 h + 1 · ( h + 1 ) ! · ( 3 x t ) · f h + 2 ( t ) = i = 1 h + 1 M ( h + 1 , i ) · f ( i ) ( t ) ( 3 x t ) 2 h + 1 i ,
or
2 h + 1 · ( h + 1 ) ! · f h + 2 ( t ) = i = 1 h + 1 M ( h + 1 , i ) · f ( i ) ( t ) ( 3 x t ) 2 h + 2 i .
Thus, Lemma 2 is also valid for n = h + 1 . From now on, Lemma 2 has been proved. □
Lemma 3.
The following power series expansion holds for arbitrary positive integers h and k:
f ( h ) ( t ) ( 3 x t ) k = 1 ( 3 x ) k n = 0 i = 0 n ( n i + h ) ! ( n i ) ! · B n i + h ( x ) ( 3 x ) i · i + k 1 i t n ,
where t and x are any real numbers with | t | < | 3 x | .
Proof. 
According to the definition of the balancing polynomials B n ( x ) , we have:
f ( t ) = 1 1 6 x t + t 2 = n = 0 B n ( x ) · t n .
For any positive integer h, from the properties of the power series, we can obtain
f ( h ) ( t ) = n = 0 ( n + h ) ( n + h 1 ) ( n + 1 ) · B n + h ( x ) · t n = n = 0 ( n + h ) ! n ! · B n + h ( x ) · t n .
For all real t and x with | t | < | 3 x | , we have the following power series expansion:
1 3 x t = 1 3 x · n = 0 t n ( 3 x ) n ,
and
1 ( 3 x t ) k = 1 ( 3 x ) k · n = 0 n + k 1 n · t n ( 3 x ) n ,
with any positive integer k. Then, it is found that
f ( h ) ( t ) ( 3 x t ) k = 1 ( 3 x ) k · n = 0 ( n + h ) ! n ! · B n + h ( x ) · t n n = 0 n + k 1 n · t n ( 3 x ) n = 1 ( 3 x ) k n = 0 i + j = n ( j + h ) ! j ! · B j + h ( x ) · i + k 1 i · 1 ( 3 x ) i t n = 1 ( 3 x ) k n = 0 i = 0 n ( n i + h ) ! ( n i ) ! · B n i + h ( x ) · i + k 1 i · 1 ( 3 x ) i t n ,
where we have used the multiplicative of the power series. Lemma 3 has been proved. □

3. Proof of Theorem

Based on the lemmas in the above section, it is easy to deduce the proof of Theorem 1. For any positive integer h, we can derive
2 h · h ! · f h + 1 ( t ) = 2 h · h ! · n = 0 B n ( x ) · t n h + 1 = 2 h · h ! · n = 0 a 1 + a 2 + + a h + 1 = n B a 1 ( x ) B a 2 ( x ) B a h + 1 ( x ) · t n .
On the other hand, by the observation made in Lemma 3, it is deduced that
2 h · h ! · f h + 1 ( t ) = j = 1 h M ( h , j ) · f ( j ) ( t ) ( 3 x t ) 2 h j = j = 1 h M ( h , j ) ( 3 x ) 2 h j · n = 0 i = 0 n ( n i + j ) ! ( n i ) ! · B n i + j ( x ) · 2 h + i j 1 i · 1 ( 3 x ) i t n = n = 0 j = 1 h M ( h , j ) ( 3 x ) 2 h j i = 0 n ( n i + j ) ! ( n i ) ! · B n i + j ( x ) ( 3 x ) i · 2 h + i j 1 i · t n .
Altogether, we obtain the identity:
2 h · h ! a 1 + a 2 + + a h + 1 = n B a 1 ( x ) B a 2 ( x ) B a h + 1 ( x ) = j = 1 h M ( h , j ) ( 3 x ) 2 h j i = 0 n ( n i + j ) ! ( n i ) ! · B n i + j ( x ) ( 3 x ) i · 2 h + i j 1 i .
This proves Theorem 1.

4. Conclusions

In this paper, a representation of a linear combination of balancing polynomials B i ( x ) (see Theorem 1) is obtained. Moreover, the specific expressions of M ( h , i ) is given by using mathematical induction (see Lemma 1).
Theorem 1 can be reduced to various studies for the specific values of x, n, and h in the literature. For example, if n = 0 , our results reduce to Corollary 1. Taking h = 2 , our results reduce to Corollary 2. Taking x = 1 , h = 2 , 3, our results reduce to Corollary 3 and Corollary 4, respectively.

Funding

This work is supported by the N. S. F. (11771351) of China.

Acknowledgments

The author would like to thank the Editor and the referees for their very helpful and detailed comments, which have significantly improved the presentation of this paper.

Conflicts of Interest

The author declares that there are no conflicts of interest regarding the publication of this paper.

References

  1. Behera, A.; Panda, G.K. On the square roots of triangular numbers. Fibonacci Quart. 1999, 37, 98–105. [Google Scholar]
  2. Panda, G.K.; Komatsu, T.; Davala, R.K. Reciprocal sums of sequences involving balancing and lucas-balancing numbers. Math. Rep. 2018, 20, 201–214. [Google Scholar]
  3. Panda, G.K. Some fascinating properties of balancing numbers. Congr. Numer. 2009, 194, 185–189. [Google Scholar]
  4. Patel, B.K.; Ray, P.K. The period, rank and order of the sequence of balancing numbers modulo m. Math. Rep. 2016, 18, 395–401. [Google Scholar]
  5. Komatsu, T.; Szalay, L. Balancing with binomial coefficients. Int. J. Number. Theory 2014, 10, 1729–1742. [Google Scholar] [CrossRef]
  6. Finkelstein, R. The house problem. Am. Math. Mon. 1965, 72, 1082–1088. [Google Scholar] [CrossRef]
  7. Ray, P.K. Balancing and Cobalancing Numbers. Ph.D. Thesis, National Institute of Technology, Rourkela, India, 2009. [Google Scholar]
  8. Zhang, Y.X.; Chen, Z.Y. A new identity involving the Chebyshev polynomials. Mathematics 2018, 6, 244. [Google Scholar] [CrossRef]
  9. Zhao, J.H.; Chen, Z.Y. Some symmetric identities involving Fubini polynomials and Euler numbers. Symmetry 2018, 10, 303. [Google Scholar]
  10. Ma, Y.K.; Zhang, W.P. Some identities involving Fibonacci polynomials and Fibonacci numbers. Mathematics 2018, 6, 334. [Google Scholar] [CrossRef]
  11. Kim, D.S.; Kim, T. A generalization of power and alternating power sums to any Appell polynomials. Filomat 2017, 1, 141–157. [Google Scholar] [CrossRef]
Table 1. Values of M ( h , i ) .
Table 1. Values of M ( h , i ) .
M ( h , i ) i = 1 i = 2 i = 3 i = 4 i = 5 i = 6 i = 7 i = 8
h = 1 1
h = 2 11
h = 3 331
h = 4 151561
h = 5 10510545101
h = 6 945945420105151
h = 7 10,39510,39547251260210211
h = 8 135,135135,13562,37017,3253150378281

Share and Cite

MDPI and ACS Style

Meng, Y. A New Identity Involving Balancing Polynomials and Balancing Numbers. Symmetry 2019, 11, 1141. https://doi.org/10.3390/sym11091141

AMA Style

Meng Y. A New Identity Involving Balancing Polynomials and Balancing Numbers. Symmetry. 2019; 11(9):1141. https://doi.org/10.3390/sym11091141

Chicago/Turabian Style

Meng, Yuanyuan. 2019. "A New Identity Involving Balancing Polynomials and Balancing Numbers" Symmetry 11, no. 9: 1141. https://doi.org/10.3390/sym11091141

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