A=B /
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 rece...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Other Authors: | , , |
| Format: | eBook |
| Language: | English |
| Published: |
Wellesley, Mass. :
A K Peters,
©1996.
|
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
| Summary: | 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. |
|---|---|
| Physical Description: | 1 online resource (xii, 212 pages : illustrations.) |
| Bibliography: | Includes bibliographical references (pages 201-208) and index. |
| ISBN: | 9780429064586 0429064586 |