Proofs That Really Count
The Art of Combinatorial Proof
Will be published approx. on 1. January 2003
Book
Paperback/Softback
194 pages
978-1-4704-7259-7 (ISBN)
Description
Mathematics is the science of patterns, and mathematicians attempt to understand these patterns and discover new ones using a variety of tools. In Proofs That Really Count, award-winning math professors Arthur Benjamin and Jennifer Quinn demonstrate that many number patterns, even very complex ones, can be understood by simple counting arguments. The book emphasizes numbers that are often not thought of as numbers that count: Fibonacci Numbers, Lucas Numbers, Continued Fractions, and Harmonic Numbers, to name a few. Numerous hints and references are given for all chapter exercises and many chapters end with a list of identities in need of combinatorial proof. The extensive appendix of identities will be a valuable resource. This book should appeal to readers of all levels, from high school math students to professional mathematicians.
Reviews / Votes
"This book is written in an engaging, conversational style, and this reviewer found it enjoyable to read through (besides learning a few new things). Along the way, there are a few surprises, like the 'world's fastest proof by induction' and a magic trick. As a resource for teaching, and a handy basic reference, it will be a great addition to the library of anyone who uses combinatorial identities in their work." -Society for Industrial and Applied Mathematics ReviewMore details
Series
Language
English
Place of publication
Providence
United States
Target group
Professional and scholarly
ISBN-13
978-1-4704-7259-7 (9781470472597)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification