Summation of binomial coefficients using hypergeometric functions
Document Type
Conference Proceeding
Date of Original Version
10-1-1986
Abstract
An algorithm which finds the definite sum of many series involving binomial coefficients is present.ed. The method examines the ratio of two consecutive terms of the series in an attempt to express the sum as an ordinary hypergeometric function. A closed form for the infinite sum may be found by comparing the resulting function with known summation theorems. It may also be possible to identify ranges of the summation index for which summing to a' finite upper limit is the same as summing to infinity.
Publication Title, e.g., Journal
Proceedings of the 5th ACM Symposium on Symbolic and Algebraic Computation, SYMSAC 1986
Citation/Publisher Attribution
Hayden, Michael B., and Edmund A. Lamagna. "Summation of binomial coefficients using hypergeometric functions." Proceedings of the 5th ACM Symposium on Symbolic and Algebraic Computation, SYMSAC 1986 (1986): 77-81. doi: 10.1145/32439.32454.