Discrete Mathematics

Description

NOTE: This edition features the same content as the traditional text in a convenient, three-hole-punched, loose-leaf version. Books a la Carte also offer a great value; this format costs significantly less than a new textbook. Before purchasing, check with your instructor or review your course syllabus to ensure that you select the correct ISBN. For Books a la Carte editions that include MyLab™ or Mastering™, several versions may exist for each title – including customized versions for individual schools – and registrations are not transferable. In addition, you may need a Course ID, provided by your instructor, to register for and use MyLab or Mastering products.

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.

About our author

Richard Johnsonbaugh is Professor Emeritus of Computer Science, Telecommunications and Information Systems, DePaul University, Chicago. Prior to his 20-year service at DePaul University, he was a member and sometime chair of the mathematics departments at Morehouse College and Chicago State University. He has a B.A. degree in mathematics from Yale University, M.A. and Ph.D. degrees in mathematics from the University of Oregon, and an M.S. degree in computer science from the University of Illinois, Chicago. His most recent research interests are in pattern recognition, programming languages, algorithms, and discrete mathematics. He is the author or co-author of numerous books and articles in these areas. Several of his books have been translated into various languages. He is a member of the Mathematical Association of America.

NOTE: This edition features the same content as the traditional text in a convenient, three-hole-punched, loose-leaf version. Books a la Carte also offer a great value; this format costs significantly less than a new textbook. Before purchasing, check with your instructor or review your course syllabus to ensure that you select the correct ISBN. For Books a la Carte editions that include MyLab™ or Mastering™, several versions may exist for each title – including customized versions for individual schools – and registrations are not transferable. In addition, you may need a Course ID, provided by your instructor, to register for and use MyLab or Mastering products.

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.

New and updated features of this title

• Additional real-world examples provide more context for ideas and concepts. Also, examples that are worked problems now clearly identify where the solution begins and ends.
• Examples have been added to illustrate diverse approaches to developing proofs and alternative ways to prove a particular result.
• More than 300 new exercises increase the total to nearly 4,500.
  • More than 100 new exercises and examples have been added to the first 3 chapters: Sets and Logic; Proofs; and Functions, Sequences, and Relations. There are now more than 1,750 worked examples and exercises in these chapters.
• Exercises have been added to give an example of an algebraic system in which prime factorization does not hold.
• Chapter self-test exercises read more like real exams, no longer identifying relevant sections within the exercises. Hints to these exercises identify relevant sections for further reference.

Hallmark features of this title

• Problem Solving Corners help students attack and solve problems, and show them how to do proofs.
• Strong emphasis on reading and writing proofs illustrates most proofs of theorems with annotated figures to provide additional explanation and insight into the proofs.
• Extensive discussion of algorithms, recursive algorithms, and the analysis of algorithms: Algorithms are written in a flexible form of pseudocode resembling languages such as C, C++ and Java.
• Figures and tables illustrate concepts, show how algorithms work, elucidate proofs, and motivate the material.
• Short URLs give easy access to corresponding web pages, especially with a mobile device.