Discrete Mathematics, Global Edition 8e Johnsonbaugh 9781292233703

For one- or two-term introductory courses in discrete mathematics.

An accessible introduction to the topics of discrete math, this best-selling text also works to expand students’ mathematical maturity.

With nearly 4,500 exercises, Discrete Mathematics provides ample opportunities for students to practice, apply, and demonstrate conceptual understanding. Exercise sets features a large number of applications, especially applications to computer science. The almost 650 worked examples provide ready reference for students as they work. A strong emphasis on the interplay among the various topics serves to reinforce understanding. The text models various problem-solving techniques in detail, then provides opportunity to practice these techniques. The text also builds mathematical maturity by emphasizing how to read and write proofs. Many proofs are illustrated with annotated figures and/or motivated by special Discussion sections. The side margins of the text now include “tiny URLs” that direct students to relevant applications, extensions, and computer programs on the textbook website.

Extend students’ mathematical maturity and ability to deal with abstraction

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

EXPANDED! More than 100 new exercises have been added to the first three chapters: Sets and Logic, Proofs, and Functions, Sequences, and Relations. There are now more than 1,750 worked examples and exercises in these chapters.

Problem Solving Corners, a hallmark feature that helps students attack and solve problems and show them how to do proofs.

Extensive discussion of algorithms, recursive algorithms, and the analysis of algorithms — The algorithms are written in a flexible form of pseudocode, which resembles currently popular languages such as C, C++, and Java.

Extensive applications with an emphasis on computer science. Approximately 150 computer exercises are included throughout the book.

Emphasis on the interplay among the various topics — For example, 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. Figure captions provide additional explanation and insight into figures accompanying proofs.

Summaries of the mathematical and algorithmic notation used in the book on the inside covers.