Request for consultation
MATHEMATICS: A DISCRETE INTRODUCTION teaches students the fundamental concepts in discrete mathematics and proof-writing skills. With its clear presentation, the text shows students how to present cases logically beyond this course. All of the material is directly applicable to computer science and engineering, but it is presented from a mathematician's perspective. Students will learn that discrete mathematics is very useful, especially those whose interests lie in computer science and engineering, as well as those who plan to study probability, statistics, operations research, and other areas of applied mathematics.
- 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.
Joy. Speaking (and Writing) of Mathetimatics. Definition. Theorem. Proof. Counterexample. Boolean Algebra. Self Test.
Lists. Factorial. Sets I: Introduction, Subsets. Quantifiers. Sets II: Operations. Combinatorial Proof: Two Examples. Self Test.
3. COUNTING AND RELATIONS.
Relations. Equivalence Relations. Partitions. Binomial Coefficients. Counting Multisets. Inclusion-Exclusion. Self Test.
4. MORE PROOF.
Contradiction. Smallest Counterexample. Induction. Recurrence Relations. Self Test.
Functions. The Pigeonhole Principle. Composition. Permutations. Symmetry. Assorted Notation. Self Test.
Sample Space. Events. Conditional Probability and Independence. Random Variables. Expectation. Self Test.
7. NUMBER THEORY.
Dividing. Greatest Common Divisor. Modular Arithmetic. The Chinese Remainder Theorem. Factoring. Self Test.
Groups. Group Isomorphism. Subgroups. Fermat's Little Theorem. Public-Key Cryptography I: Introduction. Public-Key Cryptography II: Rabin's Method. Public-Key Cryptography III: RSA. Self Test.
Graph Theory Fundamentals. Subgraphs. Connection. Trees. Eulerian Graphs. Coloring. Planar Graphs. Self Test.
10. PARTIALLY ORDERED SETS.
Partially Ordered Sets Fundamentals. Max and Min. Linear Orders. Linear Extensions. Dimension. Lattices. Self Test.
Lots of Hints and Comments; Some Answers. Solutions to Self Tests. Glossary. Fundamentals.
Cengage provides a range of supplements that are updated in coordination with the main title selection. For more information about these supplements, contact your Learning Consultant.