'''Petkovšek's algorithm''' (also '''Hyper''') is a [[computer algebra]] algorithm that computes a basis of [[Hypergeometric identity|hypergeometric terms]] solution of its input [[P-recursive equationsequation|linear recurrence equation with polynomial coefficients]]. Equivalently, it computes a first order right factor of linear [[difference operator]]s with polynomial coefficients. This algorithm was developed by [[Marko Petkovšek]] in his PhD-thesis 1992.<ref name=":0">{{Cite journal|last=Petkovšek|first=Marko|date=1992|title=Hypergeometric solutions of linear recurrences with polynomial coefficients|url=http://linkinghub.elsevier.com/retrieve/pii/0747717192900386|journal=Journal of Symbolic Computation|volume=14|issue=2-3|pages=243–264|doi=10.1016/0747-7171(92)90038-6|issn=0747-7171|via=}}</ref> The algorithm is implemented in all the major computer algebra systems.
