## Discrete MathematicsThe distinguishing characteristic of Ross and Wright is a sound mathematical treatment that increases smoothly in sophistication. The book presents utility-grade discrete math tools so students can understand them, use them, and move on to more advanced mathematical topics. *NEW-An introductory section giving gentle, motivated warm-up questions that point out the importance of precision, examples, and abstraction as problem-solving tools. *NEW-Dependence on previous mathematical background and sophistication is reduced to give students with rusty skills a better chance at understanding the new ideas in discrete mathematics. *NEW-The chapter on elementary logic is extensively revised to place even more emphasis on logical thinking. *NEW-A revised presentation makes algorithms easier to translate into object-oriented programs. *NEW-Some long sections have been broken up. In particular, the account of Boolean algebras is substantially reworked to keep the abstract outline clear and to lead naturally to applications. *NEW-The section on big-oh notation is now in the chapter on induction where it is also closer to the algorithmic applications. *NEW-Chapters devoted to probability and al |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

SETS SEQUENCES AND FUNCTIONS | 1 |

ELEMENTARY LOGIC | 69 |

RELATIONS | 131 |

Copyright | |

10 other sections not shown

### Other editions - View all

### Common terms and phrases

acyclic digraph answer argument atoms binary tree Boolean algebra Boolean expression Boolean function Calculate called Chapter choose closed path compound proposition connected Consider countable cycle defined digits digraph Dijkstra's algorithm elements equivalence relation Euler circuit Example fact false gcd(m give given graph G graph in Figure Hasse diagram Hence hypothesis implies infinite input integers isomorphic Karnaugh map Lemma log2 logically equivalent loop invariant maps Mathematical Induction matrix minimum spanning tree minterm MODp multiple nonempty notation one-to-one correspondence oo oo oo output partial order partition paths of length poset positive integers predicate prime Principle probability proof propositional calculus prove real numbers recursive definition Repeat Exercise rooted tree rule SEQ(n Show smallest sorted labeling subset Suppose tautology Theorem true truth table truth values variables verify vertex vertex sequence vertices weight wff's words write