1 Introduction

As is well known, the Legendre polynomial P n (x) is a solutions of the following differential equation:

( 1 x 2 ) u 2x u +n(n+1)u=0(see [1–7]),

where n=0,1,2, .

It is a polynomial of degree n. If n is even or odd, then P n (x) is accordingly even or odd. They are determined up to constant and normalized so that P n (1)=1.

Rodrigues’ formula is given by

P n (x)= 1 2 n n ! { ( d d x ) n ( x 2 1 ) n } ,n Z + .
(1.1)

Integrating by parts, we can derive

1 1 P m (x) P n (x)dx= 2 2 n + 1 δ m , n (see [1–7]),
(1.2)

where δ m , n is the Kronecker symbol.

By (1.1), we get

P n (x)= 1 2 n k = 0 [ n 2 ] ( 1 ) k ( n k ) ( 2 n 2 k n ) x n 2 k .
(1.3)

The generating function is given by

( 1 2 x t + t 2 ) 1 2 = n = 0 P n (x) t n .
(1.4)

The Bernoulli polynomial is defined by a generating function to be

t e t 1 e x t = e B ( x ) t = n = 0 B n (x) t n n ! (see [8–13])
(1.5)

with the usual convention about replacing B n (x) by B n (x).

In the special case, x=0, B n (0)= B n are called the Bernoulli numbers.

From (1.5), we have

B n (x)= l = 0 n ( n l ) B n l x l (see [10–26]).
(1.6)

As is well known, the Euler numbers are defined by

E 0 =1, ( E + 1 ) n + E n =2 δ 0 , n (see [10–13])
(1.7)

with the usual convention about replacing E n by E n .

The Euler polynomials are defined as

E n (x)= l = 0 n ( n l ) E n l x l (see [27–31]).
(1.8)

Let P n ={p(x)O[x]|degp(x)n}. Then P n is an inner product space with respect to the inner product , with

q 1 ( x ) , q 2 ( x ) = 1 1 q 1 (x) q 2 (x)dx,

where q 1 (x), q 2 (x) P n .

From (1.2), we can show that { P 0 (x), P 1 (x),, P n (x)} is an orthogonal basis for P n . In this paper, we derive some interesting identities on the Bernoulli and Euler polynomials from the orthogonality of Legendre polynomials in P n .

2 Some identities on the Bernoulli and Euler polynomials

For q(x) P n , let

q(x)= k = 0 n C k P k (x).
(2.1)

Then, from (1.2), we have

q ( x ) , P k ( x ) = C k P k ( x ) , P k ( x ) = C k 1 1 { P k ( x ) } 2 d x = 2 2 k + 1 C k .
(2.2)

By (2.2), we get

C k = 2 k + 1 2 q ( x ) , P k ( x ) = 2 k + 1 2 1 1 P k ( x ) q ( x ) d x = ( 2 k + 1 2 ) 1 2 k k ! 1 1 ( d k d x k ( x 2 1 ) k ) q ( x ) d x = ( 2 k + 1 2 k + 1 k ! ) 1 1 ( d k d x k ( x 2 1 ) k ) q ( x ) d x .
(2.3)

Therefore, by (2.1) and (2.3), we obtain the following proposition.

Proposition 2.1 Forq(x) P n , let

q(x)= k = 0 n C k P k (x).

Then

C k = 2 k + 1 2 k + 1 k ! 1 1 ( d k d x k ( x 2 1 ) k ) q(x)dx.

Let us assume that q(x)= x n P n .

From Proposition 2.1, we have

C k = 2 k + 1 2 k + 1 k ! 1 1 ( d k d x k ( x 2 1 ) k ) x n d x = 2 k + 1 2 k + 1 ( 1 ) k ( n k ) 1 1 ( x 2 1 ) k x n k d x = 2 k + 1 2 k + 1 ( n k ) ( 1 + ( 1 ) n k ) 0 1 ( 1 x 2 ) k x n k d x .
(2.4)

For nk0(mod2), by (2.4), we get

C k = 2 k + 1 2 k + 1 ( n k ) 0 1 ( 1 y ) k y n k 1 2 d y = 2 k + 1 2 k + 1 ( n k ) B ( k + 1 , n k + 1 2 ) = 2 k + 1 2 k + 1 ( n k ) Γ ( k + 1 ) Γ ( n k + 1 2 ) Γ ( n + k + 1 2 + 1 ) = 2 k + 1 2 k + 1 ( n k ) k ! Γ ( n k + 1 2 ) ( n + k + 1 2 ) ( n + k 1 2 ) ( n k + 1 2 ) Γ ( n k + 1 2 ) = 2 k + 1 2 k + 1 ( n k ) k ! 2 k + 1 ( n k ) ! ( n + k + 2 ) ( n + k ) ( n k + 2 ) ( n + k + 2 ) ! = ( 2 k + 1 ) 2 k + 1 ( n + k + 2 ) ! × n ! ( n + k + 2 2 ) ! ( n k 2 ) ! .
(2.5)

Here the beta function B(x,y) is defined by

B(x,y)= 0 1 t x 1 ( 1 t ) y 1 dt ( Re ( x ) , Re ( y ) > 0 ) ,

and it is well known that

B(x,y)= Γ ( x ) Γ ( y ) Γ ( x + y ) ,

where Γ(s)= 0 t s 1 e t dt (Re(s)>0) is the gamma function.

By Proposition 2.1 and (2.5), we get

x n = 0 k n , n k 0 ( mod 2 ) ( 2 k + 1 ) n ! 2 k + 1 ( n + k + 2 2 ) ! ( n + k + 2 ) ! ( n k 2 ) ! P k (x).
(2.6)

From (1.5), we can easily derive the following equation (2.7):

x n = 1 n + 1 l = 0 n ( n + 1 l ) B l (x)(n Z + ).
(2.7)

Therefore, by (2.6) and (2.7), we obtain the following Proposition 2.2.

Proposition 2.2 Forn Z + , we have

l = 0 n B l ( x ) ( n + 1 l ) ! l ! = 0 k n , n k 0 ( mod 2 ) ( 2 k + 1 ) 2 k + 1 ( n + k + 2 2 ) ! ( n + k + 2 ) ! ( n k 2 ) ! P k (x).

Let us take q(x)= B n (x) P n . By Proposition 2.1, we get

C k = 2 k + 1 2 k + 1 k ! 1 1 ( d k d x k ( x 2 1 ) k ) B n ( x ) d x = ( 1 ) k ( 2 k + 1 ) 2 k + 1 ( n k ) 1 1 ( x 2 1 ) k B n k ( x ) d x = ( 1 ) k ( 2 k + 1 ) 2 k + 1 ( n k ) l = 0 n k ( n k l ) B n k l 1 1 ( x 2 1 ) k x l d x = 2 k + 1 2 k + 1 ( n k ) l = 0 n k ( n k l ) B n k l ( 1 + ( 1 ) l ) 0 1 ( 1 x 2 ) k x l d x .
(2.8)

For l Z + with l0(mod2), we have

C k = 2 k + 1 2 k + 1 ( n k ) 0 l n k , l is even ( n k l ) B n k l 0 1 ( 1 y ) k y l 1 2 d y = 2 k + 1 2 k + 1 ( n k ) 0 l n k , l is even ( n k l ) B n k l Γ ( k + 1 ) Γ ( l + 1 2 ) Γ ( 2 k + l + 1 2 + 1 ) = ( 2 k + 1 ) 2 k + 1 n ! 0 l n k , l 0 ( mod 2 ) B n k l ( n k l ) ! × ( 2 k + l + 2 2 ) ! ( 2 k + l + 2 ) ! ( l 2 ) ! .
(2.9)

In [14], we showed that

B n (x)= k = 0 n 2 ( n k ) B n k E k (x)+ E n (x)= k = 0 , k n 1 n ( n k ) B n k E k (x).
(2.10)

Therefore, by Proposition 2.1, (2.9) and (2.10), we obtain the following theorem.

Theorem 2.3 Forn Z + , we have

1 n ! k = 0 , k n 1 n ( n k ) B n k E k (x)= k = 0 n ( 0 l n k , l 0 ( mod 2 ) ( 2 k + 1 ) 2 k + 1 ( l + 2 k + 2 2 ) ! B n k l ( n k l ) ! ( l + 2 k + 2 ) ! ( l 2 ) ! ) P k (x).

By the same method of Theorem 2.3, we easily see that

E n ( x ) n ! = k = 0 n ( 0 l n k , l 0 ( mod 2 ) ( 2 k + 1 ) 2 k + 1 ( l + 2 k + 2 2 ) ! B n k l ( n k l ) ! ( l + 2 k + 2 ) ! ( l 2 ) ! ) P k (x).
(2.11)

Let us take q(x)= k = 0 n B k (x) B n k (x) P n . Then we see that

(2.12)

The equation (2.12) was proved in [14].

By (2.12) and Proposition 2.2, we have

C k = 2 k + 1 2 k + 1 k ! { ( n + 1 ) l = 0 n ( n l ) n l + 1 ( m = l n B m l B n m + B n 1 l ) × 1 1 E l ( x ) ( d k d x k ( x 2 1 ) k ) d x + ( n 2 1 ) n 12 1 1 ( d k d x k ( x 2 1 ) k ) E n 2 ( x ) d x } .
(2.13)

Integrating by parts, we get

(2.14)

Then we see that

(2.15)

It is easy to show that

(2.16)

Therefore, by (2.13), (2.14), (2.15) and (2.16), we get

C k = ( 2 k + 1 ) 2 k + 1 { ( n + 1 ) l = k n ( n k ) n l + 1 ( m = l n B m l B n m + B n 1 l ) × k j l , j k 0 ( mod 2 ) ( l j ) E l j j ! ( j + k + 2 ) ! × ( j + k + 2 2 ) ! ( j k 2 ) ! + ( n 2 1 ) n 12 k j n 2 , j k 0 ( mod 2 ) ( n 2 j ) E n 2 j j ! ( j + k + 2 ) ! × ( j + k + 2 2 ) ! ( j k 2 ) ! } .
(2.17)

Therefore, by Proposition 2.1 and (2.17), we obtain the following theorem.

Theorem 2.4 Forn Z + , we have

k = 0 n B k ( x ) B n k ( x ) = k = 0 n ( 2 k + 1 ) 2 k + 1 { ( n + 1 ) l = k n ( n k ) n l + 1 ( m = l n B m l B n m + B n 1 l ) × k j l , j k 0 ( mod 2 ) ( l j ) E l j j ! ( j + k + 2 ) ! × ( j + k + 2 2 ) ! ( j k 2 ) ! + ( n 2 1 ) n 12 k j n 2 , j k 0 ( mod 2 ) ( n 2 j ) E n 2 j j ! ( j + k + 2 ) ! × ( j + k + 2 2 ) ! ( j k 2 ) ! } P k ( x ) .

Remark 2.5 The extended Laguerre polynomials are given by

L n α (x)= r = 0 n ( 1 ) r r ! ( n + α n r ) x r (α>1).

By the same method, we get

L n α (x)= k = 0 n 0 l n k , l 0 ( mod 2 ) ( 1 ) k + l ( 2 k + 1 ) 2 k + 1 ( n + α n k l ) ( l + 2 k + 2 2 ) ! ( l + 2 k + 2 ) ! ( l 2 ) ! P k (x)

and

H n (x)= k = 0 n 0 l n k , l 0 ( mod 2 ) ( 2 k + 1 ) 2 2 k + l + 1 n ! ( l + 2 k + 2 2 ) ! H n k l ( n k l ) ! ( l + 2 k + 2 ) ! ( l 2 ) ! P k (x),

where H n (x) is the Hermite polynomial of degree n (see [7]).