Edition DescriptionRevised edition
Table Of Content0. Yes, There Are Proofs! 1. Logic 2. Sets and Relations 3. Functions 4. The Integers 5. Induction and Recursion 6. Principles of Counting 7. Permutations and Combinations 8. Algorithms 9. Graphs 10. Paths and Circuits 11. Applications of Paths and Circuits 12. Trees 13. Planar Graphs and Colorings 14. The Max Flow -- Min Cut Theorem
SynopsisFar more "user friendly" than the vast majority of similar books, this text is truly written with the "beginning" reader in mind. The pace is tight, the style is light, and the text emphasizes theorem proving throughout. The authors emphasize "Active Reading," a skill vital to success in learning how to think mathematically (and write clean, error-free programs)., Far more "user friendly" than the vast majority of similar books, this volume is truly written with the unsophisticated reader in mind. The pace is leisurely, but the authors are rigorous and maintain a serious attitude towards theorem proving throughout. Emphasizes "Active Reading" throughout, a skill vital to success in learning how to write proofs. Offers two sections on probability (2.4 and 2.5). Moves material on depth-first search, which previously comprised an entire (very short) chapter, to an earlier chapter where it fits more naturally. Rewrites section on RNA chains to include a new (and easier) algorithm for the recovery of an RNA chain from its complete enzyme digest. Provides true/false questions (with all answers in the back of the book) in every section. Features an appendix on matrices. A useful reference for mathematics enthusiasts who want to learn how to write proofs. ", Far more "user friendly" than the vast majority of similar books, this volume is truly written with the unsophisticated reader in mind. The pace is leisurely, but the authors are rigorous and maintain a serious attitude towards theorem proving throughout. Emphasizes "Active Reading" throughout, a skill vital to success in learning how to write proofs. Offers two sections on probability (2.4 and 2.5). Moves material on depth-first search, which previously comprised an entire (very short) chapter, to an earlier chapter where it fits more naturally. Rewrites section on RNA chains to include a new (and easier) algorithm for the recovery of an RNA chain from its complete enzyme digest. Provides true/false questions (with all answers in the back of the book) in every section. Features an appendix on matrices. A useful reference for mathematics enthusiasts who want to learn how to write proofs.
LC Classification NumberQA39.3.G66 2006