Proofs that really count : the art of combinatorial proof
Material type: TextSeries: Dolciani Mathematical Expositions ; No. 27Publication details: Rhode Island, USA: Mathematical Association of America, [c2003]Description: 194 pISBN: 9780883853337LOC classification: QA13.5Online resources: Click here to access onlineItem type | Current library | Collection | Shelving location | Call number | Status | Notes | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|---|---|
Book | ICTS | Mathematic | Rack No 4 | QA164.8 (Browse shelf (Opens below)) | Available | Billno: 43170 ; Billdate: 26.04.2019 | 02012 | ||
Book | ICTS | Mathematic | Rack No 4 | QA164.8 (Browse shelf (Opens below)) | Available | Billno: 42888 ; Billdate: 20.03.2019 | 01836 |
Chapter 1. Fibonacci Identities
Chapter 2. Gibonacci and Lucas Identities
Chapter 3. Linear Recurrences
Chapter 4. Continued Fractions
Chapter 5. Binomial Identities
Chapter 6. Alternating Sign Binomial Identities
Chapter 7. Harmonic and Stirling Number Identities
Chapter 8. Number Theory
Chapter 9. Advanced Fibonacci & Lucas Identities
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. --- summary provided by publisher
There are no comments on this title.