Revision as of 20:50, 5 November 2014 edit Bsalvy (talk \| contribs) 10 edits No edit summary ← Previous edit		Revision as of 20:52, 5 November 2014 edit undo Bsalvy (talk \| contribs) 10 edits No edit summary Next edit →
Line 1: '''Petkovšek's algorithm''' is a [[computer algebra]] algorithm that computes a basis of [[hypergeometric identity\|hypergeometric terms]] solution of its input linear recurrence equation with polynomial coefficients. Equivalently, it computes a first order right factor of linear [[difference operator]]s with polynomial coefficients. This algorithm is implemented in all the major computer algebra systems. == Examples ==

Petkovšek's algorithm: Difference between revisions