Mathematics – Combinatorics
Scientific paper
2008-10-02
J. Number Theory 129 (2009) 2111-2132
Mathematics
Combinatorics
22 pages; Final version. References updated and a typo in (8.1) corrected
Scientific paper
We present a computer algebra approach to proving identities on Bernoulli polynomials and Euler polynomials by using the extended Zeilberger's algorithm given by Chen, Hou and Mu. The key idea is to use the contour integral definitions of the Bernoulli and Euler numbers to establish recurrence relations on the integrands. Such recurrence relations have certain parameter free properties which lead to the required identities without computing the integrals.
Chen William Y. C.
Sun Lisa H.
No associations
LandOfFree
Extended Zeilberger's Algorithm for Identities on Bernoulli and Euler Polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Extended Zeilberger's Algorithm for Identities on Bernoulli and Euler Polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extended Zeilberger's Algorithm for Identities on Bernoulli and Euler Polynomials will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-492699