In a comprehensive yet easy-to-follow manner, Discrete Mathematics for New Technology follows the progression from the basic mathematical concepts covered by the GCSE in the UK and by high-school algebra in the USA to the more sophisticated mathematical concepts examined in the latter stages of the book. The book punctuates the rigorous treatment of theory with frequent uses of pertinent examples and exercises, enabling readers to achieve a feel for the subject at hand. The exercise hints and solutions are provided at the end of the book. Topics covered include logic and the nature of mathematical proof, set theory, relations and functions, matrices and systems of linear equations, algebraic structures, Boolean algebras, and a thorough treatise on graph theory. Although aimed primarily at computer science students, the structured development of the mathematics enables this text to be used by undergraduate mathematicians, scientists, and others who require an understanding of discrete mathematics.
Note: This is the 3rd edition.
Aimed at undergraduate mathematics and computer science students, this book is an excellent introduction to a lot of problems of discrete mathematics.
This new edition includes new chapters on statements and proof, logical framework, natural numbers and the integers and updated exercises from the previous edition.
The book begins with an introductory chapter that provides an accessible explanation of discrete mathematics.
Important Notice: Media content referenced within the product description or the product text may not be available in the ebook version.
The text is designed to motivate and inspire the reader, encouraging further study in this important skill.
This books gives an introduction to discrete mathematics for beginning undergraduates. One of original features of this book is that it begins with a presentation of the rules of logic as used in mathematics.
This concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms.
This approachable text studies discrete objects and the relationsips that bind them.
Discrete Mathematics