3 Review(s)

Discrete Mathematical Structures combines a balance of theory and applications with mathematical rigor and an accessible writing style. The text is ideal for one- or two-semester courses and for students who are typically mathematics, mathematics education, or computer science majors. Key Features Extensive applications cover a broad range of topics and appeal to diverse student interests, while the depth and quantity of exercises meet instructor needs Unique among similar texts, Part I features proofs as its central topic--taking the approach that basic set theory is the best area in which to first learn how to write proofs Table Of Contents 1. Logic and Sets 2. Basic Proof Writing 3. Elementary Number Theory 4. Indexed by Integers 5. Relations 6. Basic Counting 7. More Counting 8. Basic Graph Theory 9. Graph Properties 10.Trees and Algorithms Appendix A: Assumed Properties of Z and R Appendix B: Pseudocode Bibliography Index