Best Discrete Mathematics Books

Here you will get Best Discrete Mathematics Books For you.This is an up-to-date list of recommended books.

1. Proofs: A Long-Form Mathematics Textbook (The Long-Form Math Textbook Series)

Author: by Jay Cummings
Published at: Independently published (January 19, 2021)
ISBN: 979-8595265973

View on Amazon

This textbook is designed for students. Rather than the typical definition-theorem-proof-repeat style, this text includes much more commentary, motivation and explanation. The proofs are not terse, and aim for understanding over economy. Furthermore, dozens of proofs are preceded by “scratch work” or a proof sketch to give students a big-picture view and an explanation of how they would come up with it on their own.

This book covers intuitive proofs, direct proofs, sets, induction, logic, the contrapositive, contradiction, functions and relations. The text aims to make the ideas visible, and contains over 200 illustrations. The writing is relaxed and conversational, and includes periodic attempts at humor.

This text is also an introduction to higher mathematics. This is done in-part through the chosen examples and theorems. Furthermore, following every chapter is an introduction to an area of math. These include Ramsey theory, number theory, topology, sequences, real analysis, big data, game theory, cardinality and group theory.

2. The Book of Why: The New Science of Cause and Effect

Author: by Judea Pearl
Published at: Basic Books; Reprint edition (August 25, 2020)
ISBN: 978-1541698963

View on Amazon

A Turing Award-winning computer scientist and statistician shows how understanding causality has revolutionized science and will revolutionize artificial intelligence “Correlation is not causation.” This mantra, chanted by scientists for more than a century, has led to a virtual prohibition on causal talk.

Today, that taboo is dead. The causal revolution, instigated by Judea Pearl and his colleagues, has cut through a century of confusion and established causality – the study of cause and effect – on a firm scientific basis. His work explains how we can know easy things, like whether it was rain or a sprinkler that made a sidewalk wet; and how to answer hard questions, like whether a drug cured an illness.

Pearl’s work enables us to know not just whether one thing causes another: it lets us explore the world that is and the worlds that could have been. It shows us the essence of human thought and key to artificial intelligence.

Anyone who wants to understand either needs The Book of Why.

3. Elements of Programming Interviews: The Insiders' Guide

Author: by Adnan Aziz
Published at: CreateSpace Independent Publishing Platform; 2nd edition (October 11, 2012)
ISBN: 978-1479274833

View on Amazon

This is the C++ version of our book. See the website for links to the Java version, as well as to a version that uses larger fonts.Have you ever… Wanted to work at an exciting futuristic company? Struggled with an interview problem that could have been solved in 15 minutes?

Wished you could study real-world computing problems? If so, you need to read Elements of Programming Interviews (EPI). EPI is your comprehensive guide to interviewing for software development roles. The core of EPI is a collection of over 250 problems with detailed solutions.

The problems are representative of interview questions asked at leading software companies. The problems are illustrated with 200 figures, 300 tested programs, and 150 additional variants. The book begins with a summary of the nontechnical aspects of interviewing, such as strategies for a great interview, common mistakes, perspectives from the other side of the table, tips on negotiating the best offer, and a guide to the best ways to use EPI.

4. Introduction to Graph Theory (Dover Books on Mathematics)

Author: by Richard J. Trudeau
Published at: Dover Publications; 2nd edition (February 9, 1994)
ISBN: 978-0486678702

View on Amazon

A stimulating excursion into pure mathematics aimed at “the mathematically traumatized,” but great fun for mathematical hobbyists and serious mathematicians as well. Requiring only high school algebra as mathematical background, the book leads the reader from simple graphs through planar graphs, Euler’s formula, Platonic graphs, coloring, the genus of a graph, Euler walks, Hamilton walks, and a discussion of The Seven Bridges of Konigsberg.

Exercises are included at the end of each chapter. “The topics are so well motivated, the exposition so lucid and delightful, that the book’s appeal should be virtually universal … Every library should have several copies” Choice.1976 edition.

5. Discrete Mathematics with Applications

Author: by Susanna S. Epp
Published at: Cengage Learning; 5th edition (January 1, 2019)
ISBN: 978-1337694193

View on Amazon

DISCRETE MATHEMATICS WITH APPLICATIONS, 5th Edition, explains complex, abstract concepts with clarity and precision and provides a strong foundation for computer science and upper-level mathematics courses of the computer age. Author Susanna Epp presents not only the major themes of discrete mathematics, but also the reasoning that underlies mathematical thought.

Students develop the ability to think abstractly as they study the ideas of logic and proof. While learning about such concepts as logic circuits and computer addition, algorithm analysis, recursive thinking, computability, automata, cryptography and combinatorics, students discover that the ideas of discrete mathematics underlie and are essential to today’s science and technology.

6. Discrete Mathematics and Its Applications Seventh Edition

Author: by Kenneth Rosen
Published at: McGraw-Hill Education; 7th edition (June 14, 2011)
ISBN: 978-0073383095

View on Amazon

Discrete Mathematics and Its Applications is intended for one or two term introductory Discrete Mathematics courses taken by students from a wide variety of majors, including Computer Science, Mathematics, and Engineering. This renowned best-selling text, which has been used at over 500 institutions around the world, gives a focused introduction to the primary themes in a Discrete Mathematics course and demonstrates the relevance and practicality of Discrete Mathematics to a wide variety of real-world applicationsfrom Computer Science to Data Networking, to Psychology, to Chemistry, to Engineering, to Linguistics, to Biology, to Business, and many other important fields.

McGraw-Hill’s Connect, is also available as an optional, add on item. Connect is the only integrated learning system that empowers students by continuously adapting to deliver precisely what they need, when they need it, how they need it, so that class time is more effective.

Connect allows the professor to assign homework, quizzes, and tests easily and automatically grades and records the scores of the student’s work. Problems are randomized to prevent sharing of answers an may also have a “multi-step solution” which helps move the students’ learning along if they experience difficulty.


The Algorithm Design Manual
Author: by Steven S Skiena
Published at: Springer; 2nd edition (April 27, 2011)
ISBN: 978-1848000698

View on Amazon

This newly expanded and updated second edition of the best-selling classic continues to take the “mystery” out of designing algorithms, and analyzing their efficacy and efficiency. Expanding on the first edition, the book now serves as the primary textbook of choice for algorithm design courses while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students.

The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Techniques, provides accessible instruction on methods for designing and analyzing computer algorithms. The second part, Resources, is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations and an extensive bibliography.

NEW to the second edition: Doubles the tutorial material and exercises over the first edition Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video Contains a unique catalog identifying the 75 algorithmic problems that arise most often in practice, leading the reader down the right path to solve them Includes several NEW “war stories” relating experiences from real-world applications Provides up-to-date links leading to the very best algorithm implementations available in C, C++, and Java.

8. Book of Proof

Author: by Richard Hammack
Published at: Richard Hammack; 3rd edition (October 1, 2018)
ISBN: 978-0989472128

View on Amazon

This book is an introduction to the language and standard proof methods of mathematics. It is a bridge from the computational courses (such as calculus or differential equations) that students typically encounter in their first year of college to a more abstract outlook.

It lays a foundation for more theoretical courses such as topology, analysis and abstract algebra. Although it may be more meaningful to the student who has had some calculus, there is really no prerequisite other than a measure of mathematical maturity.

Topics include sets, logic, counting, methods of conditional and non-conditional proof, disproof, induction, relations, functions, calculus proofs and infinite cardinality.

9. Introductory Discrete Mathematics (Dover Books on Computer Science)

Author: by V. K . Balakrishnan
Published at: Dover Publications (October 18, 2010)
ISBN: 978-0486691152

View on Amazon

This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. Mathematics educators consider it vital that their students be exposed to a course in discrete methods that introduces them to combinatorial mathematics and to algebraic and logical structures focusing on the interplay between computer science and mathematics.

The present volume emphasizes combinatorics, graph theory with applications to some stand network optimization problems, and algorithms to solve these problems. Chapters 03 cover fundamental operations involving sets and the principle of mathematical induction, and standard combinatorial topics: basic counting principles, permutations, combinations, the inclusion-exclusion principle, generating functions, recurrence relations, and an introduction to the analysis of algorithms.

Applications are emphasized wherever possible and more than 200 exercises at the ends of these chapters help students test their grasp of the material. Chapters 4 and 5 survey graphs and digraphs, including their connectedness properties, applications of graph coloring, and more, with stress on applications to coding and other related problems.

10. Algorithms Illuminated (Part 4): Algorithms for NP-Hard Problems

Author: by Tim Roughgarden
Published at: Soundlikeyourself Publishing, LLC (July 16, 2020)
ISBN: 978-0999282960

View on Amazon

When, in 1984?86, Richard P. Feynman gave his famous course on computation at the California Institute of Technology, he asked Tony Hey to adapt his lecture notes into a book. Although led by Feynman, the course also featured, as occasional guest speakers, some of the most brilliant men in science at that time, including Marvin Minsky, Charles Bennett, and John Hopfield.

Although the lectures are now thirteen years old, most of the material is timeless and presents a ?Feynmanesque? Overview of many standard and some not-so-standard topics in computer science such as reversible logic gates and quantum computers.

12. Discrete-Time Signal Processing (Prentice-Hall Signal Processing Series)

Author: by Alan Oppenheim
Published at: Pearson; 3rd edition (August 18, 2009)
ISBN: 978-0131988422

View on Amazon

THE definitive, authoritative guide to DSP ideal for those with an introductory-level knowledge of signals and systems but not necessarily DSP. Written by a prominent, standard-setting team. KEY TOPICS: Provides thorough treatment of the fundamental theorems and properties of discrete-time linear systems, filtering, sampling, and discrete-time Fourier Analysis.

Focuses on the general and universal concepts in discrete-time signal processing – making the content vital and relevant to the new challenges arising in the field without limiting itself to specific technologies with relatively short life spans. Discusses the wide range of present and future applications of the technology, and features a wealth of examples.

MARKET: For anyone wanting a thorough introduction to Discrete-Time Signal Processing.

13. Discrete Mathematics: An Open Introduction

Author: by Oscar Levin
Published at: Independently published (December 31, 2018)
ISBN: 978-1792901690

View on Amazon

Note: This is the 3rd edition. If you need the 2nd edition for a course you are taking, it can be found as a “other format” on amazon, or by searching its isbn: 1534970746This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach.

The text began as a set of lecture notes for the discrete mathematics course at the University of Northern Colorado. This course serves both as an introduction to topics in discrete math and as the “introduction to proof” course for math majors.

The course is usually taught with a large amount of student inquiry, and this text is written to help facilitate this. Four main topics are covered: counting, sequences, logic, and graph theory. Along the way proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs.

The book contains over 470 exercises, including 275 with solutions and over 100 with hints. There are also Investigate! Activities throughout the text to support active, inquiry based learning. While there are many fine discrete math textbooks available, this text has the following advantages: It is written to be used in an inquiry rich course.

14. Discrete Mathematics (Quick Study Academic)

Author: by Inc. BarCharts
Published at: QuickStudy; Lam Rfc Cr edition (May 31, 2015)
ISBN: 978-1423224884

View on Amazon

Skills used in business and also present in most middle & high school math competitions. Computer science is almost entirely built upon this higher-level real world math that teaches reasoning and proof techniques. Often a required course for computer science majors, this 6-page guide is your reference tool for success.

Suggested uses: Professors/Teachers tool for continued reference throughout a course, use to build quizzes, for open-guide tests, and as support for struggling students Students quick and easy reference tool, math competitions, review guide for quizzes, tests, exams and homework help Computer Science Majors a must have for a core principle within your studies

15. McDougal Littell Advanced Math: Student Edition 2003

Published at: MCDOUGAL LITTEL; Student edition (May 23, 2002)
ISBN: 978-0618250370

McDougal Littell Advanced Math: Student Edition 2003 Cover

View on Amazon

Clean copy, tight binding, cover in good condition front and back.

16. Numerical Methods for Engineers

Author: by Steven Chapra
Published at: McGraw-Hill Education; 7th edition (January 24, 2014)
ISBN: 978-0073397924

View on Amazon

The seventh edition of Chapra and Canale’s Numerical Methods for Engineers retains the instructional techniques that have made the text so successful. Chapra and Canale’s unique approach opens each part of the text with sections called Motivation, Mathematical Background, and Orientation Each part closes with an Epilogue containing Trade-Offs, Important Relationships and Formulas, and Advanced Methods and Additional References.

Much more than a summary, the Epilogue deepens understanding of what has been learned and provides a peek into more advanced methods. Numerous new or revised problems are drawn from actual engineering practice. The expanded breadth of engineering disciplines covered is especially evident in these exercises, which now cover such areas as biotechnology and biomedical engineering.

Excellent new examples and case studies span all areas of engineering giving students a broad exposure to various fields in engineering.