Summation of binomial coefficients using hypergeometric functions

Authors:
Michael B. Hayden;Edmund A. Lamagna
Affiliations:
Univ. of Rhode Island, Kingston;Univ. of Rhode Island, Kingston
Venue:
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Year:
1986

Citing 5
Cited 1

The analysis of algorithms

The analysis of algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Summation in Finite Terms

Journal of the ACM (JACM)
Syntax oriented analysis of the run time performance of programs

Syntax oriented analysis of the run time performance of programs
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Symbolic summation with generating functions

ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm which finds the definite sum of many series involving binomial coefficients is presented. 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.