• No results found

Some identities for the product of two Bernoulli and Euler polynomials

N/A
N/A
Protected

Academic year: 2020

Share "Some identities for the product of two Bernoulli and Euler polynomials"

Copied!
14
0
0

Loading.... (view fulltext now)

Full text

(1)

R E S E A R C H

Open Access

Some identities for the product of two Bernoulli

and Euler polynomials

Dae San Kim

1

, Taekyun Kim

2*

, Sang-Hun Lee

3

and Young-Hee Kim

3

* Correspondence: [email protected]

2Department of Mathematics,

Kwangwoon University, Seoul 139-701, Republic of Korea

Full list of author information is available at the end of the article

Abstract

Letℙnbe the space of polynomials of degree less than or equal ton. In this article, using the Bernoulli basis {B0(x), . . . ,Bn(x)} forℙnconsisting of Bernoulli polynomials, we investigate some new and interesting identities and formulae for the product of two Bernoulli and Euler polynomials like Carlitz did.

1 Introduction

The Bernoulli and Euler polynomials are defined by means of

t et1e

xt=

n=0

Bn(x)

tn

n!, 2

et+ 1e xt=

n=0

En(x)

tn

n!. (1)

In the special case,x= 0,Bn(0) =BnandEn(0) =Enare called then-th Bernoulli and

Euler numbers (see [1-17]). From (1), we note that

Bn(x) = n

l=0

n l

Blxnl,En(x) = n

l=0

n l

Elxnl. (2)

Forn≥0, we have

d

dxBn(x) =nBn−1(x), d

dxEn(x) =nEn−1(x), (3)

(see [7,8]).

By (1), we get the following recurrence for the Bernoulli and the Euler numbers:

B0= 1,Bn(1)Bn=δ1,nandE0= 1,En(1) +En= 2δ0,n, (4)

whereδk, nis the Kronecker symbol (see [1-17]).

Thus, from (3) and (4), we have

1

0

Bn(x)dx= δ0,n

n+ 1, 1

0

En(x)dx=−2En+1

n+ 1. (5)

(2)

It is known [12] that of two Bernoulli polynomials:

Bm(x)Bn(x) =

noulli polynomials, we investigate some new and interesting identities and formulae for the product of two Bernoulli and Euler polynomials like Carlitz did.

2 Bernoulli identities arising from Bernoulli basis polynomials From (1), we note that

(3)

Thus, from (12), we have

xn= 1

n+ 1(Bn+1(x+ 1)−Bn+1(x)) = 1

n+ 1 n

l=0

n+ 1

l

Bl(x). (13)

From (13), we note that {B0(x), B1(x), . . . , Bn(x)} spans ℙn. For p(x) Î ℙn, let p(x) =nk=0akBk(x) and g(x) = p(x+ 1)- p(x). Then we have

g(x) = n

k=0

ak(Bk(x+ 1)−Bk(x)) = n

k=0

kakxk−1. (14)

From (14), we can derive the following Equation (15):

g(r)(x) = n

k=r+1

k(k−1). . .(kr)akxkr−1, (15)

where g(r)(x) = drg(x)

dxr andr = 0, 1, 2, . . . ,n. Let us take x= 0 in (15). Then we have

g(r)(0) = (r+ 1)!ar+1. (16)

By (16), we get, forr= 1, 2, . . . ,n,

ar=

g(r−1)(0)

r! = 1

r!(p

(r−1)(1)p(r−1)(0)). (17)

Let 0 =p(x) =nk=0akBk(x). Then, from (17), we have

ar= 1

r!g

(r−1)(0) = 1

r!(p

(r−1)(1)p(r−1)(0)) = 0. (18)

From (18), we note that {B0(x), B1(x), . . . , Bn(x)} is a linearly independent set. Therefore, we obtain the following theorem.

Proposition 1The set of Bernoulli polynomials{B0(x),B1(x), . . . ,Bn(x)}is a basis forℙn. Let us consider polynomial p(x)Îℙnas a linear combination of Bernoulli basis poly-nomials with

p(x) =C0B0(x) +C1B1(x) +· · ·+CnBn(x). (19)

We can write (19) as a dot product of two variables:

p(x) = (B0(x),B1(x),. . .,Bn(x)) ⎛ ⎜ ⎜ ⎜ ⎝

C0

C1

.. .

Cn ⎞ ⎟ ⎟ ⎟

⎠. (20)

From (20), we can derive the following equation:

p(x) = (1,x,x2,. . .,xn) ⎛ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎝

1b12b13· · ·b1n+1 0 1 b23· · ·b2n+1 0 0 1 · · ·b3n+1 ..

. ... ... . .. ... 0 0 0 · · ·bnn+1 0 0 0 · · ·1

⎞ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎠

⎛ ⎜ ⎜ ⎜ ⎜ ⎜ ⎝

C0

C1

C2 .. .

Cn ⎞ ⎟ ⎟ ⎟ ⎟ ⎟ ⎠

(4)

where bij are the coefficients of the power basis that are used to determine the

respective Bernoulli polynomials. It is easy to show that

B0(x) = 1, B1(x) =x− 1

2, B2(x) =x

2x+1

6, B3(x) =x 33

2x 2+1

2x, . . .. In the quadratic case (n= 2), the matrix representation is

p(x) = (1, x, x2) ⎛ ⎝1−

1 2

1 6 0 1 −1

0 0 1

⎞ ⎠

⎛ ⎝CC01

C2 ⎞

⎠. (22)

In the cubic case (n= 3), the matrix representation is

p(x) = (1,x,x2,x3) ⎛ ⎜ ⎜ ⎝

1−12 16 0 0 1 −1 12 0 0 1 −32

0 0 0 1

⎞ ⎟ ⎟ ⎠

⎛ ⎜ ⎜ ⎝

C0

C1

C2

C3 ⎞ ⎟ ⎟

⎠. (23)

In many applications of Bernoulli polynomials, a matrix formulation for the Bernoulli polynomials seems to be useful.

There are many ways of obtaining polynomial identities in general. Here, in Theo-rems 2-9, we use the Bernoulli basis in order to express certain polynomials as linear combinations of that basis and hence to get some new and interesting polynomial identities.

Let Im,n= 1

0 Bm(x)Bn(x)dxform,nZ+. Then, by integration by parts, we get

I0,n=Im,0= 0, Im,n= (−1)m+n

Bm+n

m+n m

, (m, n≥2).

(24)

FornÎℤ+withn≥2, let us consider the following polynomials inℙn:

p(x) = n

k=0

Bk(x)Bnk(x)∈Pn. (25)

Then, from (25), we have

p(r)(x) = (n+ 1)! (nr+ 1)!

n

k=r

Bkr(x)Bnk(x), (26)

wherer= 0, 1, 2, . . .n.

By Proposition 1, we see thatp(x) can be written as

p(x) = n

k=0

akBk(x). (27)

From (25) and (27), we note that

a0= 1

0

p(t)dt= n

k=0

Ik,nk=Bn n−1

k=1

(−1)k−1

n k

=Bn

(1 + (−1)n)

n+ 2 = 2

(5)

By (18) and (26), we get

Therefore, by (25), (27) and (28), we obtain the following theorem.

Theorem 2 For nÎℤ+with n≥2, we have

(6)

Therefore, from (29), (30) and (33), we obtain the following theorem.

Theorem 3 For nÎℤ+with n≥2, we have

n

k=0

n k

Bk(x)Bnk(x) = n

k=0 k=n−1

2k

n k

BnkBk(x).

Let nÎℤ+withn≥ 2. Then we consider polynomialp(x) inℙnwith

p(x) = n−1

k=1 1

k(nk)Bk(x)Bnk(x).

By Proposition 1, we see thatp(x) is written as

p(x) = n

k=0

akBk(x). (34)

From (34), we have

a0= 1

0

p(t)dt= n−1

k=1 1

k(nk) 1

0

Bk(t)Bnk(t)dt

= n−1

k=1 1

k(nk)

(−1)k−1

n k

Bn=

1 + (−1)n

n2

Bn= 2Bn

n2 .

It is easy to show that forr= 1, 2 , . . . ,n- 1,

p(r)(x) = 2CrBnr(x) + (n−1)· · ·(nr) n−1

k=r+1

Bkr(x)Bnk(x)

(kr)(nk), (35)

where Cr= 1

nr

r

j=1(n−1) ... (nj+ 1)(nj−1) ... (nr).

By (17), we get

ar+1= 1 (r+ 1)!(p

(r)(1)p(r)(0))

= 1

(r+ 1)!

2Cr(Bnr(1)Bnr)

+(n−1). . .(nr) n−1

k=r+1

Bkr(1)Bnk(1)BkrBnk (kr)(nk)

= 2Cr

(r+ 1)!δr,n−1+ 1

n

n r+ 1

n−1

k=r+1

Bk1,nk+δ1,krBnk+δ1,k1,nk (kr)(nk)

= ⎧ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎩

2 n(nr−1)

n r+ 1

Bnr−1if 0≤rn−3,

0 ifr=n−2,

2

n!Cn−1 ifr=n−1.

(7)

From the definition of Cr, we have

Therefore, by (34), (36) and (37), we obtain the following theorem.

Theorem 4 For nÎℤ+with n≥2, we have It is not difficult to show that

(8)

Let us take the polynomialp(x) inℙnas follows:

p(x) = n

k=0 1

k!(nk)!Ek(x)Enk(x). (41)

Then, by (41), we get

p(r)(x) = 2r n

k=r

Ekr(x)Enk(x)

(kr)!(nk)!, (42)

wherer= 0, 1, 2, . . . ,n.

By Proposition 1, we see thatp(x) can be written as

p(x) = n

k=0

akBk(x). (43)

From (41), (42) and (43), we have

a0= 1

0

p(t)dt= n

k=0 1

k!(nk)!Jk,nk

= 2En+1 (n+ 1)!

n

k=0

(−1)k−1=− 2En+1 (n+ 1)!

1 + (−1)n 2

= −2En+1 (n+ 1)!

(44)

and

ar= 1

r!(p

(r−1)(1)p(r−1)(0))

=2 r−1

r! n

k=r−1

Ekr+1(1)Enk(1)−Ekr+1Enk (kr+ 1)!(nk)!

=2 r−1

r!

− 2Enr+1

(nr+ 1)!−

2Enr+1

(nr+ 1)!+ 4δn+1,r

=− 2 r+1

(n+ 1)!

n+ 1

r

Enr+1,

(45)

wherer= 1, 2, . . . ,n.

Therefore, by (41), (43) and (45), we obtain the following theorem.

Theorem 6 For nÎℤ+, we have

n

k=0

n k

Ek(x)Enk(x) =− 2

n+ 1 n

k=0 2k

n+ 1

k

Enk+1Bk(x).

Let us take

p(x) = n−1

k=1 1

k(nk)Ek(x)Enk(x)

inℙn. Then, by Proposition 1, p(x) is given by means of basis polynomials:

p(x) = n

k=0

(9)

It is easy to show that

a0= 1

0

p(t)dt= n−1

k=1 1

k(nk)Jk,nk

= 2En+1

n+ 1 n−1

k=1 1

k(nk)

(−1)k−1

n k

= 2(1 + (−1) n

)

n2(n+ 1) En+1=

4En+1

n2(n+ 1)

and

p(k)(x) = 2CkEnk(x) + (n−1). . .(nk) n−1

l=k+1

Elk(x)Enl(x)

(lk)(nl), (k= 1, 2, . . ., n−1)

where Ck= (n1k)kj=1(n−1). . .(nj+ 1)(nj−1). . .(nk). By the same method, we get

ak= 1

k!(p

(k−1)(1)p(k−1)(0))

= 1

k!

2Ck−1(Enk+1(1)−Enk+1)

+(n−1). . .(nk+ 1) n−1

l=k

Elk+1(1)Enl(1)Elk+1Enl (lk+ 1)(nl)

=−4Ck−1

k! Enk+1.

From the construction ofCk, we note that

Ck−1

k! = 1

k!(nk+ 1) k−1

j=1

(n−1). . .(nj+ 1)(nj−1). . .(nk+ 1)

= 1

k!(nk+ 1) k−1

j=1

(n−1)! (nk)!(nj) =

n k

n(nk+ 1) k−1

j=1 1

nj

=

n k

n(nk+ 1) ⎛ ⎝n−1

j=1 1

j

nk

j=1 1

j

⎞ ⎠=

n k

n(nk+ 1)(Hn−1−Hnk).

Therefore, by the same method, we obtain the following theorem.

Theorem 7 For nÎℤ+with n≥2, we have

n−1

k=1

Ek(x)Enk(x)

k(nk) =

4En+1

n2(n+ 1)− 4

n

n

k=1

n k

nk+ 1(Hn−1−Hnk)Enk+1Bk(x).

Let

Tm,n= 1

0

(10)

From (47), we have that

Tm,0= 1

0

Bm(t)dt= δ0,m

m+ 1 and T0,n= 1

0

En(t)dt=−2En+1

n+ 1.

Form,nÎN, we have

Tm,n=

2(−1)m

(m+n+ 1)

m+n m

m+n

l=m+1 (−1)l

m+n+ 1

l

BlEn+m+1−l.

(48)

Let us consider the following polynomial in ℙn:

p(x) = n

k=0

Bk(x)Enk(x). (49)

FornÎNwithn≥2, by Proposition 1,p(x) is given by

p(x) = n

k=0

akBk(x). (50)

From (49) and (50), we note that

a0= 1

0

p(t)dt=T0,n+ n−1

k=1

Tk,nk+Tn,0

=−2En+1

n+ 1 + 2

n+ 1 n−1

k=1

n

l=k+1

(−1)k+l

n+ 1

l

n k

BlEn+1−l.

(51)

Fork= 0, 1, 2, . . . ,n, we have

p(k)(x) = (n+ 1)n. . .(n+ 2−k) n

l=k

Blk(x)Enl(x)

= (n+ 1)! (nk+ 1)!

n

l=k

Blk(x)Enl(x).

(52)

By (17), we get

ak= 1

k!(p

(k−1)(1)p(k−1)(0))

= (n+ 1)!

k!(nk+ 2)! n

l=k−1

(Blk+1(1)Enl(1)Blk+1Enl)

=

n+ 2

k

n+ 2 n

l=k−1

{(Blk+1+δ1,lk+1)(−Enl+ 2δ0,nl)−Blk+1Enl}

=

n+ 2

k

n+ 2 ⎛ ⎝−2

n

l=k−1

Blk+1EnlEnk+ 2Bnk+1+ 2δn,k ⎞ ⎠.

(11)

Therefore, by (49), (50) and (53), we obtain the following theorem.

Theorem 8 For nÎℤ+with n≥2, we have

n

k=0

Bk(x)Enk(x)

=−2En+1

n+ 1 + 2

n+ 1 n−1

k=1 n

l=k+1 (−1)k+l

n+ 1

l

n k

BlEn+1−l+ (n+ 1)Bn(x)

+ 1

n+ 2 n−2

k=1

n+ 2

k

⎛ ⎝2

n

l=k−1

Blk+1EnlEnk+ 2Bnk+1 ⎞ ⎠Bk(x).

FornÎNwithn≥2, let us take p(x) =kn=0Bk(x)Enk(x)

k!(nk)! inℙn. Then we have

p(k)(x) = 2k n

l=k

1

(lk)!(nl)!Blk(x)Enl(x). (54)

From Proposition 1, we note thatp(x) can be written as

p(x) = n

k=0

akBk(x). (55)

Thus, by (55), we get

a0= 1

0

p(t)dt= n

k=0 1

k!(nk)!Tk,nk

= T0,n

n! + n−1

k=1

Tk,nk

k!(nk)! +

Tn,0

n!

=− 2En+1 (n+ 1)!+

2 (n+ 1)!

n−1

k=1 n

l=k+1 (−1)k+l

n+ 1

l

BlEn+1−l.

(56)

From (17), we note that

ak= 1

k!(p

(k−1)(1)p(k−1)(0))

=2 k−1

k! n

l=k−1

Blk+1(1)Enl(1)Blk+1Enl (lk+ 1)!(nl)!

=2 k−1

k! ⎛

n

l=k−1

−2Blk+1Enl (lk+ 1)!(nl)!−

Enk (nk)! +

2Bnk+1

(nk+ 1)!+ 2δn,k ⎞ ⎠.

(57)

(12)

Theorem 9 For nÎNwith n≥2, we have

From (17), we note that

ak=

It is easy to show that

(13)

Therefore, from (59) and (60), we have

n−1

k=1 1

k(nk)Bk(x)Enk(x)

= 2

n(n21) n−2

k=0 n

l=k+2

(−1)k+l+1

n+ 1

l

n−2

k

BlEn+1−l

+ n−2

k=1

−2

n(nk+ 1)

n k

(Hn−1−Hnk)Enk+1

+1

n

n k −2

n−1

l=k

Blk+1Enl (lk+ 1)(nl)−

Enk

nk

Bk(x) +2

nHn−1Bn(x).

Acknowledgements

The authors would like to express their deep gratitudes to the referees for their valuable suggestions and comments.

Author details

1

Department of Mathematics, Sogang University, Seoul 121-742, Republic of Korea2Department of Mathematics, Kwangwoon University, Seoul 139-701, Republic of Korea3Division of General Education, Kwangwoon University, Seoul

139-701, Republic of Korea

Authorscontributions

All authors contributed equally to the manuscript and typed, read and approved the final manuscript.

Competing interests

The authors declare that they have no competing interests.

Received: 10 April 2012 Accepted: 2 July 2012 Published: 2 July 2012

References

1. Araci, S, Erdal, D, Seo, JJ: A study on the fermionicp-adicsq-integral representation onℤpassociated with weightedq -Bernstein andq-Genocchi polynomials. Abstr Appl Anal2011, 10 (2011). (Article ID 649248)

2. Bayad, A: Modular properties of elliptic Bernoulli and Euler functions. Adv Stud Contemp Math.20(3):389–401 (2010) 3. Carlitz, L: Product of two Eulerian polynomials. Math Mag.36, 3741 (1963). doi:10.2307/2688134

4. Carlitz, L: Note on the integral of the product of several Bernoulli polynomials. J Lond Math Soc.34, 361–363 (1959). doi:10.1112/jlms/s1-34.3.361

5. Cangul, IN, Kurt, V, Ozden, H, Simsek, Y: On the higher-orderw-q-Genocchi numbers. Adv Stud Contemp Math.19, 3957 (2009)

6. Cenkci, M, Simsek, Y, Kurt, V: Multiple two-variablep-adicq-L-function and its be-havior ats= 0. Russ J Math Phys.15, 447–459 (2008). doi:10.1134/S106192080804002X

7. Kim, DS, Kim, T: A study on the integral of the product of several Bernoulli polynomials. Rocky Mountain Journal of Mathematics. (in press)

8. Kim, DS, Dolgy, DV, Kim, HM, Lee, SH, Kim, T: Integral formula of Bernoulli polynomials. Adv Stud Contemp Math.

22(2):190–199 (2012)

9. Kim, T: An identity of symmetry for the generalized Euler polynomials. J Comput Anal Appl.13(7):12921296 (2011) 10. Kim, T: Some identities for the Bernoulli, the Euler and the Genocchi numbers and polynomials. Adv Stud Contemp

Math.20, 2328 (2010)

11. Kim, T:q-Bernoulli numbers and polynomials associated with Gaussian binomial coefficients. Russ J Math Phys.15, 51–57 (2008)

12. Mordell, LJ: Integral formulas of arithmetic characters. J Lond Math Soc.33, 371–375 (1957)

13. Ozden, H, Simsek, Y: A new extension ofq-Euler numbers and polynomials related to their interpolation functions. Appl Math Lett.21(9):934–939 (2008). doi:10.1016/j.aml.2007.10.005

14. Ryoo, CS: Some relations between twistedq-Euler numbers and Bernstein polynomials. Adv Stud Contemp Math.

21(2):217223 (2011)

15. Ryoo, CS: Some identities of the twistedq-Euler numbers and polynomials associated withq-Bernstein polynomials. Proc Jangjeon Math Soc.14(2):239248 (2011)

16. Simsek, Y: Complete sum of products of (h,q)-extension of Euler polynomials and numbers. J Diff Equ Appl.

(14)

17. Simsek, Y: Theorems on twistedL-function and twisted Bernoulli numbers. Adv Stud Contemp Math.11(2):205–218 (2005)

doi:10.1186/1687-1847-2012-95

Cite this article as:Kimet al.:Some identities for the product of two Bernoulli and Euler polynomials.Advances in Difference Equations20122012:95.

Submit your manuscript to a

journal and benefi t from:

7Convenient online submission

7Rigorous peer review

7Immediate publication on acceptance

7Open access: articles freely available online

7High visibility within the fi eld

7Retaining the copyright to your article

References

Related documents

Shocks to aggregate consumption growth merely generate a volatility of 1% , while risk in the time discount rate accounts for the remaining stock price volatility. Accordingly, if ( Y

Analysis of the expenses scandal supports these general findings: constituent perceptions of their MPs’ expenses behaviour respond to public information, but do not translate

accounts of Real Money Trading – exchange of virtual goods for everyday monies, usually United.. States dollars – illustrated distinctions between types and categories

The previous section serves to indicate the nature of Carnap’s empiricism in 1928. It is not because he ignored the problem of the foundations of knowledge

Objective : Real-time functional magnetic resonance imaging (rt-fMRI) neurofeedback (NF) uses feedback of the patient’s own brain activity to self-regulate brain networks which in

Infants may also differentially process sounds with only large acoustic deviance from contextual novelty, showing to the latter a response resembling those associated with

Having said this, to study the issue of model formulation at its most general level, the chapter turns to nonparametric inference, which theoretically seeks to

Perception of GPIC employees’ to systems that use encouragement and reward (in comparison to punishment) to assist people to improve their performance at GPIC Awareness of