Skip to main content

Summation of Harmonic Numbers

  • Conference paper
Book cover Computers and Mathematics

Abstract

The problem of finding closed forms for a summation involving harmonic numbers is considered. Solutions for ∑ ni =1P(i)H (k)i , where p(i) is a polynomial, and ∑ ni =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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. W. Gosper, “Indefinite hypergeometric sums in MACSYMA,”Proc. MACYSMA User’s Conference (1977), Berkeley CA, 237–252.

    Google Scholar 

  2. R. W. Gosper, “Decision procedures for indefinite hypergeometric summation,”Proc. Nat. Acad. Sciences, USA 75 (1978), 40–42.

    Article  MATH  MathSciNet  Google Scholar 

  3. M. B. Hayden, “Automated tools for the analysis of algorithms,” Masters Thesis, University of Rhode Island, Kingston RI (1986).

    Google Scholar 

  4. 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 

  5. C. Jordan,Calculus of Finite Differences. Chelsea, New York NY (1965).

    MATH  Google Scholar 

  6. M. Karr, “Summation in finite terms,”Journal of the ACM 28 (1981), 305–350.

    Article  MATH  MathSciNet  Google Scholar 

  7. M. Karr, “Theory of summation in finite terms,”Journal of Symbolic Computation 1 (1985), 303–315.

    Article  MATH  MathSciNet  Google Scholar 

  8. D. E. Knuth,The Art Of Computer Programming, Vol 1: Fundamental Algorithms (Second Edition). Addison-Wesley, Reading MA (1973).

    Google Scholar 

  9. R. L. Graham, D. E. Knuth and O. Patashnik,Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley, Reading MA (1989).

    MATH  Google Scholar 

  10. S.-M. Liu, “Symbolic expressions for summation of harmonic numbers,” Masters Thesis, Brown University, Providence RI (1986).

    Google Scholar 

  11. R. Moenck, “On computing closed forms for summations,”Proc. MACYSMA User’s Conference (1977), Berkeley CA, 225–236.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag New York Inc.

About this paper

Cite this paper

Savio, D.Y., Lamagna, E.A., Liu, SM. (1989). Summation of Harmonic Numbers. In: Kaltofen, E., Watt, S.M. (eds) Computers and Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9647-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-9647-5_2

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97019-6

  • Online ISBN: 978-1-4613-9647-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics