Petkovšek's algorithm: Difference between revisions

Content deleted Content added
m Copyediting in citations - nonbreaking spaces and en dashes (manually reviewed)
m task, replaced: Discr. Math. → Discrete Math. using AWB
Line 2:
 
== Examples ==
* Given the linear recurrence
 
:<math>4(n+2)(2n+3)(2n+5)a(n+2)
Line 44:
|volume=17 | number=2 | pages=83–115 | mr=2233774}}
* {{cite article|first1=Doron | last1=Zeilberger | title=A fast algorithm for proving terminating hypergeometric identities
|journal=Discr.Discrete Math. | volume=306 | number=10-11 | pages =1072–1075 | year=2006
|doi=10.1016/j.disc.2006.03.026}}
* {{cite article|first1=A. | last1=Zarzo | first2=R. J. | last2=Yanez | first3= J. S.