Discrete Mathematics

by Gary Chartrand, Ping Zhang

Chartrand and Zhang’s Discrete Mathematics presents a clearly written, student-friendly introduction to discrete mathematics. The authors draw from their background as researchers and educators to offer lucid discussions and descriptions fundamental to the subject of discrete mathematics. Unique among discrete mathematics textbooks for its treatment of proof techniques and graph theory, topics discussed also include logic, relations and functions (especially equivalence relations and bijective functions), algorithms and analysis of algorithms, introduction to number theory, combinatorics (counting, the Pascal triangle, and the binomial theorem), discrete probability, partially ordered sets, lattices and Boolean algebras, cryptography, and finite-state machines. This highly versatile text provides mathematical background used in a wide variety of disciplines, including mathematics and mathematics education, computer science, biology, chemistry, engineering, communications, and business. Some of the major features and strengths of this numerous, carefully explained examples and applications facilitate learning; more than 1,600 exercises, ranging from elementary to challenging, are included with hints/answers to all odd-numbered exercises; descriptions of proof techniques are accessible and lively; students benefit from the historical discussions throughout the textbook.

Genres: Mathematics, Computer Science

671 pages, Kindle Edition

First published March 1, 2011

About the author

Gary Theodore Chartrand is a professor emeritus of mathematics at Western Michigan University

Reviews

[Nikolas Albertson · Rating 4 out of 5]

Discrete mathematics is a beautiful subject with various applications to computer science, engineering, and applied mathematics. However, the book itself can sometimes explain concepts in a brief manner while eliminating partial understanding. Nevertheless, the book has pleasant graphics (such as seen in set theory).