This paper’s goal is to apply computer algebra technics to prove some identities involving binomial coefficients. The mathematical background of the algorithms behind the commands implemented in Mathematica was developed by Gosper, Zeilberger, [13,19,21,22] Wilf [13,18,19] and Petkovsek [13] in order to compute closed forms for hypergeo-metric series. We show how besides the known classical proof of some interesting identities it can be given also a definitely much shorter computer algebra proof, too. Finally we compare our proofs with the classical ones, both profs being given here.
展开▼
