The problem of finding closed forms for a summation involving harmonic numbers is considered. Solutions for ∑ i n =1P(i)H i (k) , where p(i) is a polynomial, and ∑ i n =1 Hi/(i+m), where m is an integer, are given. A method to automate these results is presented. This is achieved by using Moenck’s algorithm and by exploiting the relationship between polygamma functions and harmonic numbers.
Unable to display preview. Download preview PDF.
- R. W. Gosper, “Indefinite hypergeometric sums in MACSYMA,”Proc. MACYSMA User’s Conference (1977), Berkeley CA, 237–252.Google Scholar
- M. B. Hayden, “Automated tools for the analysis of algorithms,” Masters Thesis, University of Rhode Island, Kingston RI (1986).Google Scholar
- M. B. Hayden and E. A. Lamagna, “Summation involving binomial coefficients using hypergeometric functions,”Proc. ACM Symposium on Symbolic and Algebraic Computation (1986), 367–372.Google Scholar
- D. E. Knuth,The Art Of Computer Programming, Vol 1: Fundamental Algorithms (Second Edition). Addison-Wesley, Reading MA (1973).Google Scholar
- S.-M. Liu, “Symbolic expressions for summation of harmonic numbers,” Masters Thesis, Brown University, Providence RI (1986).Google Scholar
- R. Moenck, “On computing closed forms for summations,”Proc. MACYSMA User’s Conference (1977), Berkeley CA, 225–236.Google Scholar