What is included with this book?
An algorithmic approach gives readers an accessible introduction to discrete mathematics.
Focused on helping readers understand and construct proofs, Discrete Mathematics takes an algorithmic approach to emphasize problem-solving techniques. An accessible introduction to discrete math, the best-selling text works to expand mathematical maturity. With nearly 4,500 exercises and almost 650 worked examples, the 8th Edition stresses the importance of reading and writing proofs in mathematics.
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.
1. Sets and Logic
3. Functions, Sequences, and Relations
5. Introduction to Number Theory
6. Counting Methods and the Pigeonhole Principle
7. Recurrence Relations
8. Graph Theory
10. Network Models
11. Boolean Algebras and Combinatorial Circuits
12. Automata, Grammars, and Languages
13. Computational Geometry