This book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method for analyzing complex summations. Beautifully written, the book contains practical applications as well as conceptual developments that will have applications in other areas of mathematics. From the table of contents: * Proof Machines * Tightening the Target * The Hypergeometric Database * The Five Basic Algorithms: Sister Celine's Method, Gosper&'s Algorithm, Zeilberger's ...
Read More
This book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method for analyzing complex summations. Beautifully written, the book contains practical applications as well as conceptual developments that will have applications in other areas of mathematics. From the table of contents: * Proof Machines * Tightening the Target * The Hypergeometric Database * The Five Basic Algorithms: Sister Celine's Method, Gosper&'s Algorithm, Zeilberger's Algorithm, The WZ Phenomenon, Algorithm Hyper * Epilogue: An Operator Algebra Viewpoint * The WWW Sites and the Software (Maple and Mathematica) Each chapter contains an introduction to the subject and ends with a set of exercises.
Read Less
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Book. 8vo-over 7¾"-9¾" tall. Natick: Peters, 1996. First edition, first printing. 8vo. Hard cover binding, 212 pp. This book aims to show that computers are not only very fast but, in at least one field of mathematics, pretty smart too. In the area of combinatorial identities, computers are able to find very elegant proofs of difficult theorems unassisted by human intervention. New.
