Discrete MathematicsThis best-selling book provides an accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem- solving techniques. This edition has the techniques of proofs woven into the text as a running theme and each chapter has the problem-solving corner. The text provides complete coverage of: Logic and Proofs; Algorithms; Counting Methods and the Pigeonhole Principle; Recurrence Relations; Graph Theory; Trees; Network Models; Boolean Algebra and Combinatorial Circuits; Automata, Grammars, and Languages; Computational Geometry. For individuals interested in mastering introductory discrete mathematics. |
Contents
Logic and Proofs | 1 |
The Language of Mathematics | 59 |
Algorithms | 119 |
Copyright | |
10 other sections not shown
Other editions - View all
Common terms and phrases
a₁ a₂ adjacency matrix b₁ Basis Step binary tree Boolean expression C₁ combinatorial circuit common divisor contain count the number defined Definition distinct domain of discourse eight-bit strings elements equation equivalence class equivalence relation Euclidean algorithm Euler cycle Example execute line Exercise false Find flow formula function G₁ G₂ given go to line graph G graph of Figure Gray code greatest common divisor Hamiltonian cycle Inductive Step initial condition input isomorphic labeled Let G mathematical induction Multiplication Principle n-cube nondeterministic finite-state automaton obtain one-to-one output pair permutations Pigeonhole Principle planar planar graph positive integer problem proceed to line proof proposition r-combinations R₁ R₂ real number recurrence relation rooted trees S₁ SECTION sequence shortest path Show shown in Figure simple graph solution statement subgraph subsets subtree Suppose t₁ T₂ Theorem transition true v₁ v₂ vertex weighted graph worst-case x₁
References to this book
Discrete Algorithmic Mathematics, Third Edition Stephen B. Maurer,Anthony Ralston No preview available - 2005 |