A=B
"A=B" is about identities in general, and hypergeometric identities in particular, with emphasis on computer methods of discovery and proof. It's about transforming an important part of mathematics from an art to science. There should no more need to get a brilliant insight in order to evaluate sums of binomial coeficients, and many similar formulas that arise frequently in practice; readers will be able to follow a mechanical procedure and discover the answers quite systematically.
This book shows how several recently developed computer algorithms can simplify complex summations, presenting the underlying mathematical theory of these methods, the principle theorems and proofs, and advice for using two packages of Maple programs available on the official website.
Intended Audience:
Students and professionals interested in combinatorial identities will have great use for this book. People of computer science will be also interested in the authors' unique approach towards automated proofs.
This book shows how several recently developed computer algorithms can simplify complex summations, presenting the underlying mathematical theory of these methods, the principle theorems and proofs, and advice for using two packages of Maple programs available on the official website.
Intended Audience:
Students and professionals interested in combinatorial identities will have great use for this book. People of computer science will be also interested in the authors' unique approach towards automated proofs.
File format: PDF
File size: 1.19MB
>>> Download <<<
0 comments:
Post a Comment