Revision as of 20:10, 26 January 2009 edit Michael Hardy (talk \| contribs) Administrators 210,577 edits more style edits; fixed two typos ← Previous edit		Revision as of 20:11, 26 January 2009 edit undo Michael Hardy (talk \| contribs) Administrators 210,577 edits No edit summary Next edit →
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 we have ''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''). ==Outline of the algorithm==

Gosper's algorithm: Difference between revisions