## 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. |

### What people are saying - Write a review

#### LibraryThing Review

User Review - sloDavid - LibraryThingWhy is this book so tall? Good grief, it's like a notebook. I guess it's easier to fit into one's backpack though. Introduces all the basic concepts of the "science" of computer science. Logic ... Read full review

#### Review: Discrete Mathematics

User Review - Eric Sundquist - GoodreadsOh, lordy, make it stop! This book makes such interesting material completely inaccessible to those who are trying to study the subject. Maybe next time I'll try Discrete Maths for Dummies. Read full review

### Contents

Logic and Proofs | 1 |

The Language of Mathematics | 59 |

Algorithms | 119 |

Copyright | |

10 other sections not shown

### Common terms and phrases

adjacency matrix Assume Basis Step binary tree Boolean algebra Boolean expression combinatorial circuit contain count the number defined Definition denote the number distinct domain of discourse edge incident eight-bit strings elements equation equivalence class equivalence relation Euclidean algorithm Euler cycle exactly Example execute line Exercise false Find flow formula function 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 number of edges obtain one-to-one output pair paths of length permutations Pigeonhole Principle planar graph positive integer problem proceed to line processors proof proposition r-combinations real number recurrence relation rooted trees SECTION shortest path Show shown in Figure simple graph solution Solve the recurrence statement subgraph subsets subtree Suppose Theorem total number transition true vertex weighted graph worst-case

### References to this book

Discrete Algorithmic Mathematics, Third Edition Stephen B. Maurer,Anthony Ralston No preview available - 2004 |