Petkovšek's algorithm is a computer algebra algorithm used to compute a basis of hypergeometric terms from linear recurrence equations with polynomial coefficients. It was developed by Marko Petkovšek in 1992 and is implemented in all major computer algebra systems. It can also be used to compute first order right factors of linear difference operators with polynomial coefficients.

This course explores the relationship between algebra and computation, focusing on algorithms used for symbolic computation and modern algebra concepts. Subjects covered include proving combinatorial identities, Gröbner bases, symbolic integration, and experimental mathematics. Prerequisites suggest this is a mid-level course.