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 |
Contents
SETS SEQUENCES AND FUNCTIONS | 1 |
ELEMENTARY LOGIC | 69 |
RELATIONS | 131 |
Copyright | |
10 other sections not shown
Common terms and phrases
A₁ acyclic digraph answer argument atoms b₁ binary tree Boolean algebra Boolean expression Boolean function Calculate called Chapter closed path compound proposition connected Consider countable cycle defined digits digraph divisor elements equivalence relation Example fact false gcd(m give given graph G graph in Figure Hasse diagram hypothesis infinite input integers isomorphic Kruskal's algorithm Lemma logically equivalent loop invariant maps Mathematical Induction matrix minimum spanning tree minterm multiple nonempty notation one-to-one correspondence output pairs partial order paths of length poset positive integers predicate prime Principle probability proof propositional calculus prove R₁ real numbers recursive definition Repeat Exercise rooted tree rule s₁ SEQ(n Show smallest sorted labeling subset Suppose tautology Theorem true truth table truth values v₁ variables verify vertex vertex sequence vertices w₁ weight wff's write