07-25-2026, 10:41 PM
"A=B"
by Marko Petkovsek, Herbert Wilf and Doron ZeilbergerSummary
The book details a major breakthrough in computer algebra and discrete mathematics: the complete automation of discovering and proving mathematical identities, particularly hypergeometric and binomial coefficient sums. By replacing complex manual combinatorial proofs with algorithmic, computer-generated methods, the authors demonstrate how software can systematically simplify and verify intricate mathematical equations.
This hub provides free downloads of the complete book alongside updated software programs, such as EKHAD, that carry out these automated algorithms. It also features supplementary resources including errata sheets, real-world case studies, and materials from university courses built around the text.
Reviewers consistently praise the work for its engaging, accessible, and tutorial-style exposition, which makes cutting-edge research in automatic theorem proving understandable to undergraduates, computer scientists, and veteran mathematicians alike. Furthermore, the page acts as an interactive platform where readers are encouraged to report software bugs, share interesting write-ups, and contribute new applications of these algorithmic methods.
BOOK
┌────────────────────────────────┐
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘