10 Best Discrete Mathematics books That You Must Read

best discrete mathematics books

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 4th Fourth Edition
Author: Susanna S. Epp
Published at: 01/01/2011
ISBN: 8131533026

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
  • O-Notation and the efficiency of algorithms
  • Relations 
  • Graphs and trees.

Discrete Mathematics
Author: Gary Chartrand,Ping Zhang
Published at: 20/03/2011
ISBN: 1577667301

A student-friendly introduction to discrete mathematics that includes more than 1,600 exercises, ranging from elementary to challenging, is included with hints/answers to all odd-numbered 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 finite-state 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.

Mathematics: A Discrete Introduction
Author: Edward A. Scheinerman
Published at: 05/03/2012
ISBN: 0840049420

This book contains self-tests, lots of hints and comments, some answers, solutions to self-tests 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
  • Inclusion-exclusion
  • Smallest counterexample
  • Recurrence relations
  • The Pigeonhole principle.

There are many self-test that will make you confident on the exam day.

Introductory Discrete Mathematics (Dover Books on Computer Science)
Author: V. K . Balakrishnan
Published at: 18/10/2010
ISBN: 0486691152
This is the best book for undergraduate students in computer science and mathematics. This is an introductory book for students as the name suggests.

The theory of computational complexity and NP-completeness is outlined in the appendix. There are many algorithms to solve mathematical expressions.

This book covers the following important topics
  • Fundamental operations involving sets and the principle of mathematical induction
  • Basic counting principles
  • Permutations
  • Combinations
  • The inclusion-exclusion 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.

Discrete Mathematics (Quick Study Academic)
Author: Inc. BarCharts
Published at: 31/05/2015
ISBN: 1423224884

This is a reference tool for professors, teachers, and students throughout a course. It's a six-page guide used in business and also present in most middle & high school math competitions.

This must-have 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.

Discrete Mathematics for Computer Science
Author: David Liben-Nowell
Published at: 20/07/2017
ISBN: 1119441854

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 wide-ranging applications of computer science 
  • Over 450 examples
  • Chapter summaries
  • Simple quizzes
  • Approximately 1600 homework exercises of widely varying difficulty.

Discrete Mathematics (8th Edition)
Author: Richard Johnsonbaugh
Published at: 16/03/2017
ISBN: 0321964683

Discrete Mathematics provides computer science applications in a clear, high-quality 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

  • Sets and logic
  • Proofs
  • Functions, sequences, and relations
  • Algorithms
  • Introduction to number theory
  • Counting methods and the pigeonhole principle
  • Recurrence relations
  • Graph theory
  • Trees
  • Network models
  • Boolean algebras and combinatorial circuits
  • Automata, grammars, and languages
  • Computational geometry.

Discrete Mathematics and Applications (Textbooks in Mathematics)
Author: Kevin Ferland
Published at: 01/05/2017
ISBN: 1498730655

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.

Mathematics: A Discrete Introduction
Author: Edward A. Scheinerman
Published at: 06/06/2005
ISBN: 0534398987

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 proof-writing 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.

Discrete Mathematics: An Open Introduction for Teachers
Author: Oscar Levin
Published at: 30/07/2018
ISBN: 1724572636

This guide is specially written for those who will go on to teach and for a first or second-year 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 

  1. Counting
  2. Sequences
  3. Logic
  4. graph theory.

Thanks for reading this post. If you have any opinion don't hesitate to comment here. Also please subscribe our newsletter to get more updates.