10 Best Discrete Mathematics books That You Must Read
Discrete mathematics means mathematical structures are discrete rather than continuous. It is a branch of mathematics dealing with objects which do not vary smoothly in this way but have distinct, separated value.
Here you will get some of the best discrete mathematics books.
Discrete Mathematics with Applications is a great book with examples, exercises and knowledge checks. In this book, Susanna S. Epp explains the topics thoroughly and rigorously in a straightforward manner.
This book highlights the really important parts of each chapter and contains a bunch of useless color photographs, charts, diagrams, tables, vignettes, and other "educational aid" fluff that is all the rage these days with publishers.
The key topics are
 The logic of compound statements
 The logic of quantified statements
 Elementary number theory and methods of proof
 Sequences and mathematical induction
 Set theory
 Counting
 Functions
 Recursion
 ONotation and the efficiency of algorithms
 Relations
 Graphs and trees.
A studentfriendly introduction to discrete mathematics that includes more than 1,600 exercises, ranging from elementary to challenging, is included with hints/answers to all oddnumbered exercises, accessible and lively descriptions of proof techniques.
Logic, relations and functions, algorithms and analysis of algorithms, introduction to number theory, combinatorics, discrete probability, partially ordered sets, lattices and Boolean algebras, cryptography, and finitestate machines are also included to help the students.
Important coverage are
 What Is discrete mathematics?
 Logic statements
 Sets
 Methods of proof
 Mathematical induction
 Relations and functions
 Algorithms and complexity
 Integers
 Introduction to counting
 Advanced counting methods
 Discrete probability
 Partially ordered sets and boolean algebra
 Introduction to graphs
 Trees
 Planar graphs and graph colorings.
This book contains selftests, lots of hints and comments, some answers, solutions to selftests that really helped you to understand the material better.
By reading this book you will learn the importance of discrete mathematics in the fields of computer science, engineering, probability, statistics, operations research, and other areas of applied mathematics.
Some coverages are
 Speaking of mathematics
 Boolean Algebra
 Lists
 Factorial
 Operations
 Combinatorial proof
 Relations
 Equivalence relations
 Partitions
 Binomial coefficient
 Counting multisets
 Inclusionexclusion
 Smallest counterexample
 Recurrence relations
 The Pigeonhole principle.
There are many selftest that will make you confident on the exam day.
 Fundamental operations involving sets and the principle of mathematical induction
 Basic counting principles
 Permutations
 Combinations
 The inclusionexclusion principle
 Generating functions
 Recurrence relations
 Introduction to the analysis of algorithms
 Graph theory with applications to some stand network optimization problems
 Algorithms to solve these problems.
This is a reference tool for professors, teachers, and students throughout a course. It's a sixpage guide used in business and also present in most middle & high school math competitions.
This musthave quick reference will be your success tool.
This guide includes
 Graphs & trees
 Functions & set relations
 Counting
 Sets
 Mathematical induction
 Sequences
 Methods of proof
 Proving universal statements
 Quantified statements
 Arguments
 The logic of statements.
This guide includes many important topics including basic data types, logic, proofs, mathematical induction, analysis of algorithms, number theory, relations, counting, probability, graphs, and trees.
It's a great book for computer science students.
Discrete Mathematics for Computer Science provides you
 A comprehensive treatment of standard course topics for the introductory discrete mathematics course
 The relationship between the concepts and their application to computer science
 A wide selection of exercises
 Detailed exploration problems
 Examples and problems inspired by wideranging applications of computer science
 Over 450 examples
 Chapter summaries
 Simple quizzes
 Approximately 1600 homework exercises of widely varying difficulty.
Discrete Mathematics provides computer science applications in a clear, highquality format. It also includes exercise sets including basic exercises, advanced exercises, and computer exercises, which are designed to allow your students to master what they have learned before moving on to more difficult material. Important coverage are

Discrete Mathematics and Applications emphasizes proofs, which will appeal to a subset of this course market. It covers trees, algorithms and focuses on graph theory.
The supporting materials in this book will help you get an outstanding number on the exam. This guide is used for mathematics, mathematics education, and computer science majors. It consists of two parts.
Part one focuses on
 How to write proofs
 Then moves on to topics in number theory
 employing set theory in the process.
Part two focuses on
 Computations
 Combinatorics
 Graph theory
 Trees, and algorithms.
This textbook is really a great intro from counting to basic cryptography to graph theory. After reading this book you will be able to understand both the topic and the construction of the book.
This book gives two primary objectives
 It teaches students fundamental concepts in discrete mathematics
 It teaches students proofwriting skills.
You'll know
 how to write proofs
 how to think clearly
 To present cases logically beyond this course.
 The usefulness of discrete mathematics is very useful.
This guide is specially written for those who will go on to teach and for a first or secondyear undergraduate course for math majors.
This guide covers
 363 exercises
 233 with answers or full solutions
 130 more involved problems suitable for homework
 A full index and a list of symbols
 Examples of important definitions and theorems inboxes.
Covered Four main topics are
 Counting
 Sequences
 Logic
 graph theory.