Discrete MathematicsFor a one or twoterm introductory course in discrete mathematics.
Focused on helping students understand and construct proofs and expanding their mathematical maturity, this bestselling text is an accessible introduction to discrete mathematics. Johnsonbaugh's algorithmic approach emphasizes problemsolving techniques. The Seventh Edition reflects user and reviewer feedback on both content and organization. 
What people are saying  Write a review
User ratings
5 stars 
 
4 stars 
 
3 stars 
 
2 stars 
 
1 star 

User Review  Flag as inappropriate
may i know how much does this book costs in the market
User Review  Flag as inappropriate
Excellent book to read. Specially problem solving corner is very entertaining. I enjoyed reading the book.
Contents
Sets and Logic  1 
Proofs  66 
This section can be omitted without loss of continuity  117 
Copyright  
17 other sections not shown
Other editions  View all
Discrete Mathematics: Pearson New International Edition Richard Johnsonbaugh No preview available  2013 
Common terms and phrases
1ton adjacency matrix assume Basis Step binary search binary tree Boolean expression combinatorial circuit common divisor compute contains convex hull count the number deﬁned Deﬁnition denote diagram domain of discourse edge elements equal equation equivalence classes equivalence relation Euclidean algorithm Euler cycle execute false ﬁnd ﬁnite set finitestate ﬁnitestate automaton ﬁrst ﬁve ﬂow formula Give an example given grammar graph G greatest common divisor Hamiltonian cycle Inductive Step input integer isomorphic labeled least length loop mathematical induction matrix obtain onetoone output pair path permutations Pigeonhole Principle points positive integer problem ProblemSolving propositional function prove real numbers recurrence relation reﬂexive represents rooted tree Section Review Exercises sequence Show solution solve sort subgraph subset Suppose symbol symmetric Theorem transitive trominoes true upper bound vertex worstcase Write a program xP(x
References to this book
Discrete Algorithmic Mathematics, Third Edition Stephen B. Maurer,Anthony Ralston No preview available  2005 