A = B by Marko Petkovsek
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.
Petkovsek, Marko; Wilf, Herbert S; Zeilberger, Doron
| SKU | Unavailable |
| ISBN 13 | 9781568810638 |
| ISBN 10 | 1568810636 |
| Title | A = B |
| Author | Marko Petkovsek |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Taylor & Francis Inc |
| Year published | 1996-01-01 |
| Number of pages | 230 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |