ENGLISH

A=B

By et al. , Petkovsek M.

Book information

Year
1996
Language
english
Format
DJVU
Filesize
2 MB (1622159 bytes)
Pages
212\212
Topic
Computers
Library
Kolxo3
DPI
300
Time added
2009-07-20 03:45:11

Description

In the area of combinatorial identities computers are able to find very elegant proofs of difficult theorems unassisted by human intervention. This autonomy means that not only is it possible to use a PC to find such a proof, but also the proof can be checked easily. This book shows how several recently developed computer algorithms can master the difficult job of simplifying complex summations and if there is no such simplification they will prove this to be the case. The authors present the underlying mathematical theory of these methods, the principle theorems and proofs, and include a package of computer programs that can do these tasks.

Similar books