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...
Full description
Bibliographic Details
| Main Author: |
Petkovšek, Marko |
|---|
| Corporate Author: |
Taylor & Francis |
|---|
| Other Authors: |
Wilf, Herbert S., 1931-2012,
Zeilberger, Doron,
Knuth, Donald Ervin, 1938-
(Foreword.) |
|---|
| Format: | eBook
|
|---|
| Language: | English |
|---|
| Published: |
Wellesley, Mass. :
A K Peters,
©1996.
|
|---|
| Subjects: | |
|---|
| Online Access: | Connect to the full text of this electronic book
|
|---|