This book is helpful for mathematicians and computer scientists working in finite mathematics. It presents a breakthrough method for analyzing complex summations, and contains practical applications and conceptual developments having applications in other areas of mathematics.

In the area of combinatorial identities computers are able to find very elegant proofs of difficult theorems unassisted by human intervention. This book shows how several recently developed computer algorithms can master the difficult job of simplifying complex summations.