Skip To Page Navigation|Skip To Page Content

Addison-Wesley / Prentice Hall

Mathematics

My Instructor Resource Center : Log in or request access

Discrete Mathematics, 6/E
Richard Johnsonbaugh

ISBN-10: 0131176862
ISBN-13: 9780131176867

Publisher: Prentice Hall
Copyright: 2005
Format: Cloth; 688 pp
Published: 08/04/2004

This item has been replaced by Discrete Mathematics, 7/E.

For a one- or two-term introductory course in discrete mathematics.

This best-selling book provides an accessible introduction to discrete mathematics, using an algorithmic approach that focuses on problem-solving techniques. The new edition weaves techniques of proofs into the text as a running theme. Each chapter has a special section dedicated to showing students how to attack and solve problems.

Enhanced pedagogy throughout—Includes examples, exercises, figures, tables, sections on problem-solving, section reviews, notes, chapter reviews, self-tests, and computer exercises to help students master introductory discrete mathematics.

Strong emphasis on reading and doing proofs—Illustrates most proofs of theorems with annotated figures to provide additional explanation and insight into the proofs.

Thorough discussion of algorithms, recursive algorithms, and the analysis of algorithms (Ch. 3)—The algorithms are written in a flexible form of pseudocode.

Over 500 worked examples throughout the text—Helps students understand the material.

Over 3500 exercises—Approximately one third have answers.

A large number of applications with an emphasis on computer science—Helps motivate the material.

A strong emphasis on the interplay among the various topics—E.g., mathematical induction is closely tied to recursive algorithms; the Fibonacci sequence is used in the analysis of the Euclidean algorithm; many exercises throughout the book require mathematical induction; demonstrations of how to characterize the components of a graph by defining an equivalence relation on the set of vertices; and more.

Figures and tables—Illustrate concepts, show how algorithms work, elucidate proofs, and motivate the material. Several figures illustrate proofs of theorems. Figure captions provide additional explanation and insight into the proofs.

Summaries of the mathematical and algorithm notation used in the book—Found in the inside covers.

NEW - Reorganization of Chapters 1 and 2—Chapter 1 now contains basic terminology: sets, functions, sequences, strings, and relations. Logic, extensively expanded and revised, is moved to Chapter 2. This reorganization allows the concepts of Chapter 1 to be used in the discussion of logic, thus better motivating and illustrating logic.

NEW - New chapter on introductory number theory (Ch. 4) —Integrates material on the Euclidean algorithm and expanded material on RSA public-key cryptosystem into this new chapter.

NEW - New chapter on probability (Ch. 6) —Includes new material on probability.

NEW - More Problem-Solving Corners—Helps students solve problems and do proofs.

NEW - A consistent Web icon used throughout—Indicates that more explanation and examples about a particular topic can be found on the Johnsonbaugh Companion Website (http://condor.depaul.edu/~rjohnson), or another relevant Web site.

NEW - More worked examples and exercises.

NEW - Enhanced Companion Website (http://condor.depaul.edu/~rjohnson)—Contains expanded explanations of difficult material, links to other sites for additional information about discrete mathematics topics, PowerPoint slides, a sample chapter, supplementary material, computer programs, and an errata list.

Expanded Chapter 1–Chapter 1 now contains more background material and more depth on logic and proof.

New Chapter 3–The topic of Relations has been expanded and set into a seperate chapter.

New chapter on introductory number theory (Ch. 4)–Integrates material on the Euclidean algorithm and expanded material on RSA public-key cryptosystem into this new chapter.

More Problem-Solving Corners–Helps students solve problems and do proofs (pg. 63-65, 171-173).

A consistent Web icon used throughout–Indicates that more explanation and examples about a particular topic can be found on the Johnsonbaugh Companion Website (http://condor.depaul.edu/~rjohnson), or another relevant Web site.

More worked examples (increased from 500 to 600) and exercises (increased from 3500 to 4000).

Enhanced Companion Website (http://condor.depaul.edu/~rjohnson)–Contains expanded explanations of difficult material, links to other sites for additional information about discrete mathematics topics, PowerPoint slides, a sample chapter, supplementary material, computer programs, and an errata list.

(NOTE: All Chapters end with Notes, Chapter Review, Chapter Self-Test, and Computer Exercises.)

Preface.

1. Logic and Proofs.

Propositions. Conditional Propositions and Logical Equivalence. Quantifiers. Proofs. Resolution Proofs. Mathematical Induction. Strong Form of Induction and well ordering Property.

2. The Language of Mathematics

Sets. Functions. Sequences and Strings. Relations.

3. Relations.

Relations. Equivalence Relations. Matrices of Relations. Relational Databases.

4. Algorithms.

Introduction. Correctness of Algorithms. Analysis of Algorithms. Recursive Algorithms.

5. Introduction to Number Theory.

Divisors. Representation of Integers and Integer Algorithims. The Euclidean Algorithm. The RSA Public-Key Cryptosystem.

6. Counting Methods and the Pigeonhole Principle.

Basic Principles. Permutations and Combinations. Algorithms for Generating Permutations and Combinations. Introduction to Discrete Probability. Discrete Probability Theory. Generalized Permutations and Combinations. Binomial Coefficients and Combinatorial Identities. The Pigeonhole Principle.

7. Recurrence Relations.

Introduction. Solving Recurrence Relations. Applications to the Analysis of Algorithms.

8. Graph Theory.

Introduction. Paths and Cycles. Hamiltonian Cycles and the Traveling Salesperson Problem. A Shortest-Path Algorithm. Representations of Graphs. Isomorphisms of Graphs. Planar Graphs. Instant Insanity.

9. Trees.

Introduction. Terminology and Characterizations of Trees. Spanning Trees. Minimal Spanning Trees. Binary Trees. Tree Traversals. Decision Trees and the Minimum Time for Sorting. Isomorphisms of Trees. Game Trees.

10. Network Models.

Introduction. A Maximal Flow Algorithm. The Max Flow, Min Cut Theorem. Matching.

11. Boolean Algebras and Combinatorial Circuits.

Combinatorial Circuits. Properties of Combinatorial Circuits. Boolean Algebras. Boolean Functions and Synthesis of Circuits. Applications

12. Automata, Grammars, and Languages.

Sequential Circuits and Finite-State Machines. Finite-State Automata. Languages and Grammars. Nondeterministic Finite-State Automata. Relationships Between Languages and Automata.

13. Computational Geometry.

The Closest-Pair Problem. An Algorithm to Compute the Convex Hull.

Appendices.

Matrices. Algebra Review.

References.

Hints and Solutions to Selected Exercises.

Index.

Discrete Math (Mathematics)

Discrete Mathematics, 7/E
Johnsonbaugh
©2009 | Prentice Hall | Cloth; 792 pp | Instock
ISBN-10: 0131593188 | ISBN-13: 9780131593183
Brief Description | Buy from myPearsonStore

For a one- or two-term introductory course in discrete mathematics.

Focused on helping students understand and construct proofs and expanding their mathematical maturity, this best-selling text is an accessible introduction to discrete mathematics. Johnsonbaugh’s algorithmic approach emphasizes problem-solving techniques. The Seventh Edition reflects user and reviewer feedback on both content and organization.

Discrete Mathematics |

Companion Website - Johnsonbaugh, 6/E
Johnsonbaugh
©2005 | Prentice Hall | On-line Supplement | Instock
ISBN-10: 0131855557 | ISBN-13: 9780131855557
URL: http://www.prenhall.com/johnsonbaugh

Addison-Wesley's Algebra Review
Addison-Wesley
©2004 | Prentice Hall | Paper | Out of Stock
ISBN-10: 0321247086 | ISBN-13: 9780321247087

Addison-Wesley's Basic Math Review
Addison-Wesley
©2004 | Prentice Hall | Paper | Instock
ISBN-10: 0321247078 | ISBN-13: 9780321247070

Algebra Review Study Card, 2/E
D'Ippolito & Generazzo
©2006 | Prentice Hall | Study Card; 6 pp | Instock
ISBN-10: 0321394739 | ISBN-13: 9780321394736
Buy from myPearsonStore

Allied Health Study Card, 2/E
Forshier
©2006 | Prentice Hall | Study Card | Instock
ISBN-10: 0321394747 | ISBN-13: 9780321394743
Buy from myPearsonStore

Basic Math Review Card, 2/E
Addison-Wesley
©2006 | Prentice Hall | Study Card; 6 pp | Instock
ISBN-10: 0321394763 | ISBN-13: 9780321394767
Buy from myPearsonStore

Concept Videos: Algebra
Addison-Wesley
©2008 | Prentice Hall | Multiple Media Package | Instock
ISBN-10: 0321517199 | ISBN-13: 9780321517197

Concept Videos: Basic Math & Prealgebra
Addison-Wesley
©2008 | Prentice Hall | Multiple Media Package | Instock
ISBN-10: 032151758X | ISBN-13: 9780321517586

Discovering Algebra: Examples with Keystrokes on the TI-83/TI-82 and TI-85/TI-86, A Laboratory Approach
Pirich & Bigliani
©1997 | Prentice Hall | Paper; 195 pp | Instock
ISBN-10: 0136492037 | ISBN-13: 9780136492030
Buy from myPearsonStore

Finite Mathematics Study Card
Addison-Wesley
©2006 | Prentice Hall | Study Card | Instock
ISBN-10: 0321374398 | ISBN-13: 9780321374394
Buy from myPearsonStore

Flash Review Series: Algebra
Becker
©2004 | Prentice Hall | Paper | Instock
ISBN-10: 0321143094 | ISBN-13: 9780321143099
Buy from myPearsonStore

Graphing Calculator Reference Card, 3/E
Ripley
©2006 | Prentice Hall | Study Card; 6 pp | Instock
ISBN-10: 0321394755 | ISBN-13: 9780321394750
Buy from myPearsonStore

Graphing Calculator Tutorial CD
Addison-Wesley
©2006 | Prentice Hall | CD-ROM Only | Instock
ISBN-10: 0321357744 | ISBN-13: 9780321357748
Buy from myPearsonStore

Interwrite Personal Response System
EduCue, Addison-Wesley & Benjamin Cummings
©2004 | Prentice Hall | Electronic Supplement | Instock
ISBN-10: 0321267354 | ISBN-13: 9780321267351

Math for Allied Health Study/Reference Card
Forshier
©2006 | Prentice Hall | Study Card; 0 pp | Out of Stock
ISBN-10: 0321336542 | ISBN-13: 9780321336545

Mathematics Spanish Glossary, 2/E
Lara & Peeples
©2000 | Prentice Hall | Paper; 48 pp | Instock
ISBN-10: 0201728966 | ISBN-13: 9780201728965
Buy from myPearsonStore

Overcoming Math Anxiety, 2/E
Davidson & Levitov
©2000 | Prentice Hall | Paper | Instock
ISBN-10: 0321069188 | ISBN-13: 9780321069184
Buy from myPearsonStore

Pearson TI Rebate Coupon $15, 2/E
Pearson
©2009 | Prentice Hall | Paper | Instock
ISBN-10: 0321566041 | ISBN-13: 9780321566041

Prealgebra Review Workbook
Wheel
©2006 | Prentice Hall | Paper; 300 pp | Instock
ISBN-10: 0321473329 | ISBN-13: 9780321473325
Buy from myPearsonStore

Review of Algebra, A
Howard
©2002 | Prentice Hall | Paper; 224 pp | Instock
ISBN-10: 0201773473 | ISBN-13: 9780201773477
Buy from myPearsonStore

Saleable Technology Bundle, 2/E
Pearson
©2009 | Prentice Hall | Multiple Media Package | Estimated Availability : 09/01/2008
ISBN-10: 0321561880 | ISBN-13: 9780321561886

Spanish Basic Math Study Card
Leonarte
©2007 | Prentice Hall | Study Card | Instock
ISBN-10: 0321438582 | ISBN-13: 9780321438584
Buy from myPearsonStore

Stand-alone Access Code Tutor Center
Addison-Wesley
©2008 | Prentice Hall | Access Code Card | Instock
ISBN-10: 0201721708 | ISBN-13: 9780201721706
URL: http://www.aw-bc.com/tutorcenter
Buy from myPearsonStore

For Discrete Math

Discrete Math Workbook: Interactive Exercises
Bush
©2003 | Prentice Hall | Paper; 404 pp | Instock
ISBN-10: 0130463272 | ISBN-13: 9780130463272

Practice Problems in Discrete Mathematics
Obrenic
©2003 | Prentice Hall | Paper; 275 pp | Instock
ISBN-10: 0130458031 | ISBN-13: 9780130458032

Companion Website - Johnsonbaugh, 6/E
Johnsonbaugh
©2005 | Prentice Hall | On-line Supplement | Instock
ISBN-10: 0131855557 | ISBN-13: 9780131855557
URL: http://www.prenhall.com/johnsonbaugh

Give your students a choice! PearsonChoices products are designed to give your students more value and flexibility by letting them choose from a variety of text and media formats to best match their learning style and their budget.

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students, see the Packages Tab.

Discrete Source
Pearson Custom Publishing
©2009 | Prentice Hall | On-line Supplement | Instock
ISBN-10: 0321625242 | ISBN-13: 9780321625243

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students contact your Pearson Higher Education representative.