GeezerVisonThe World Wide Web, restored to 800 pixels of glory. | ||||||||
| Home|About|Gaming cabinet|Archives|How it works|Starter sites | ||||||||
GeezerVison is showing mathworld.wolfram.com — Gosper's Algorithm -- from Wolfram MathWorld Gosper's Algorithm
An algorithm for finding closed form hypergeometric identities. The algorithm treats sums whose successive terms have ratios which
are rational functions. Not only does it decide
conclusively whether there exists a hypergeometric sequence
but actually produces
1. For the ratio 2. Write
where
for all nonnegative integers
3. Find a nonzero polynomial solution
if one exists.
4. Return Petkovšek et al. (1996) describe the algorithm as "one of the landmarks in the history of computerization of the problem of closed form summation." Gosper's algorithm is vital in the operation of Zeilberger's algorithm and the machinery of Wilf-Zeilberger pairs. See alsoHypergeometric Identity, Sister Celine's Method, Wilf-Zeilberger Pair, Zeilberger's AlgorithmExplore with Wolfram|AlphaMore things to try: ReferencesGessel, I. and Stanton, D. "Strange Evaluations of Hypergeometric Series." SIAM J. Math. Anal. 13, 295-308, 1982.Gosper, R. W. "Decision Procedure for Indefinite Hypergeometric Summation." Proc. Nat. Acad. Sci. USA 75, 40-42, 1978.Graham, R. L.; Knuth, D. E.; and Patashnik, O. Concrete Mathematics: A Foundation for Computer Science, 2nd ed. Reading, MA: Addison-Wesley, 1994.Koepf, W. "Algorithms forReferenced on Wolfram|AlphaGosper's AlgorithmCite this as:Weisstein, Eric W. "Gosper's Algorithm." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/GospersAlgorithm.html Subject classifications | ||||||||
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |