Gosper's algorithm: Difference between revisions

Content deleted Content added
top: Fixing style/layout errors
No edit summary
Line 1:
In [[mathematics]], '''Gosper's algorithm''' is a procedure for finding sums of [[Hypergeometric identities|hypergeometric terms]] that are themselves hypergeometric terms. That is: suppose one has ''a''(1) + ... + ''a''(''n'') = ''S''(''n'') − ''S''(0), where ''S''(''n'') is a hypergeometric term (i.e., ''S''(''n'' + 1)/''S''(''n'') is a [[rational function]] of ''n''); then necessarily ''a''(''n'') is itself a hypergeometric term, and given the formula for ''a''(''n'') Gosper's algorithm finds that for ''S(''n''). The algorithm is named after [[Bill Gosper]].
 
==Outline of the algorithm==