Discrete MathematicsKey Benefit: This book presents a sound mathematical treatment that increases smoothly in sophistication. Key Topics: The book presents utility-grade discrete math tools so that any reader can understand them, use them, and move on to more advanced mathematical topics. Market: A handy reference for computer scientists. |
Contents
Sets Sequences and Functions | 1 |
Elementary Logic | 50 |
Relations | 95 |
Copyright | |
19 other sections not shown
Other editions - View all
Common terms and phrases
a₁ algorithm answer atoms binary tree Boolean algebra Boolean expression Boolean function Calculate choose colorings compound proposition Consider contains cosets countable defined digit digraph divisor elements equivalence classes equivalence relation Euler path Example fact false finite formula function f gcd(m give given graph in Figure Hamilton circuit Hasse diagram homomorphism hypothesis induction infinite input integers inverse isomorphic least loop loop invariant maps Mathematical Induction matrix minimum spanning tree minterm multiple nonempty notation one-to-one correspondence orbits output pairs permutations poset positive integers prime probability proof Prove R₁ random variable real numbers recursive definition rooted tree rule s₁ semigroup Show smallest sorted labeling spanning tree strings subgroup subset Suppose tautology Theorem true truth table truth values v₁ verify vertex vertex sequence vertices w₁ weight words write