Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
