Title: Gosper's Algorithm -- from Wolfram MathWorld
Open Graph Title: Gosper's Algorithm -- from Wolfram MathWorld
X Title: Gosper's Algorithm -- from Wolfram MathWorld
Description: 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 z_n such that t_n=z_(n+1)-z_n, (1) but actually produces z_n if it exists. If not, it produces sum_(k=0)^(n-1)t_k. An outline of the algorithm follows (Petkovšek et al. 1996): 1. For the ratio r(n)=t_(n+1)/t_n which is a rational function of n. ...
Open Graph Description: 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 z_n such that t_n=z_(n+1)-z_n, (1) but actually produces z_n if it exists. If not, it produces sum_(k=0)^(n-1)t_k. An outline of the algorithm follows (Petkovšek et al. 1996): 1. For the ratio r(n)=t_(n+1)/t_n which is a rational function of n. ...
X Description: 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 z_n such that t_n=z_(n+1)-z_n, (1) but actually produces z_n if it exists. If not, it produces sum_(k=0)^(n-1)t_k. An outline of the algorithm follows (Petkovšek et al. 1996): 1. For the ratio r(n)=t_(n+1)/t_n which is a rational function of n. ...
Opengraph URL: https://mathworld.wolfram.com/GospersAlgorithm.html
Domain: mathworld.wolfram.com
| DC.Title | Gosper's Algorithm |
| DC.Creator | Weisstein, Eric W. |
| DC.Description | 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 z_n such that t_n=z_(n+1)-z_n, (1) but actually produces z_n if it exists. If not, it produces sum_(k=0)^(n-1)t_k. An outline of the algorithm follows (Petkovšek et al. 1996): 1. For the ratio r(n)=t_(n+1)/t_n which is a rational function of n. ... |
| DC.Subject | 33C |
| DC.Rights | Copyright 1999-2026 Wolfram Research, Inc. See https://mathworld.wolfram.com/about/terms.html for a full terms of use statement. |
| DC.Format | text/html |
| DC.Identifier | https://mathworld.wolfram.com/GospersAlgorithm.html |
| DC.Language | en |
| DC.Publisher | Wolfram Research, Inc. |
| DC.Relation.IsPartOf | https://mathworld.wolfram.com/ |
| DC.Type | Text |
| og:image | https://mathworld.wolfram.com/images/socialmedia/share/ogimage_GospersAlgorithm.png |
| og:type | website |
| twitter:card | summary_large_image |
| twitter:image:src | https://mathworld.wolfram.com/images/socialmedia/share/ogimage_GospersAlgorithm.png |
| None | ie=edge |
Links:
Viewport: width=device-width, initial-scale=1