序言 ●This edition has been revised based on input from reviewers and users, as well as the author's understanding of the course. This includes correcting and adding to the existing content. ●Featuring more than 25% increase in problems. Some of these new problems, which are included in problem sets and chapter tests, are interrelated to develop ideas across chapters, providing a stronger understanding of the materiel. 特色 ●Hints: Appendix A contains an extensive collection of hints (and some answers when necessary) that point students in the correct direction. ●Flexible Coverage: The topics can be arranged in various ways, allowing instructors to take a computer science and engineering focus, an abstract algebra focus, a discrete structures focus, or a broad focus. ●Self-Tests: A self-test appears at the end of every chapter. The problems are of various degrees of difficulty, and complete answers appear in Appendix B. ●Induction: The sections on mathematical induction have been reworked with new motivational material, more examples, and more problems. The induction section is now essentially independent of the proof by smallest counterexample section. ●The book includes sections covering topics such as recurrence relations and combinatorial proof. ●The introductory section, "Joy," motivates students by describing the pleasure of doing mathematics. ●Proof Templates: Proof templates appear throughout the book and give students the basic skeleton of the proof as well as boilerplate language. ●Growing Proofs: The author teaches students how to write proofs by instructing them to begin their proofs by first writing the first sentence and next writing the last sentence. Students then work the proof from both ends until they meet in the middle. ●Mathspeak: Marginal notes explain many of the idiosyncrasies of mathematical English. 作者簡介 Edward R. Scheinerman is Professor in the Department of Applied Mathematics and Statistics at The Johns Hopkins University. Dr. Scheinerman's research interests include discrete mathematics; especially graph theory, partially ordered sets, random graphs, and combinatorics, as well as applications to robotics and networks. 目錄 1. FUNDAMENTALS. 2. COLLECTIONS. 3. COUNTING AND RELATIONS. 4. MORE PROOF. 5. FUNCTIONS. 6. PROBABILITY. 7. NUMBER THEORY. 8. ALGEBRA. 9. GRAPHS. 10. PARTIALLY ORDERED SETS. APPENDICES. Lots of Hints and Comments; Some Answers. Solutions to Self Tests. Glossary. Fundamentals.