Gosper's algorithm: Difference between revisions

Revision as of 23:14, 7 February 2020

Revision as of 23:02, 28 January 2022

Line 1:

{{Short description|Summation method for hypergeometric terms}}

{{Use dmy dates|date=January 2020|cs1-dates=y}}

In [[mathematics]], '''Gosper's algorithm''', due to [[Bill Gosper]], 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'').