# Discrete Mathematics: An Open Introduction - 3rd Edition

Oscar Levin, University of Northern Colorado

Copyright Year: 2016

ISBN 13: 9781534970748

Publisher: Oscar Levin

Language: English

## Formats Available

## Conditions of Use

Attribution-ShareAlike

CC BY-SA

## Reviews

This book covers all the important topics such as set theory, logic, counting techniques, number theory, graph theory etc. These are the topics normally covered in any typical discrete math course. The "investigate" part for each concept is an... read more

This book covers all the important topics such as set theory, logic, counting techniques, number theory, graph theory etc. These are the topics normally covered in any typical discrete math course. The "investigate" part for each concept is an excellent approach. It provides a good motivation for the topic that is going to be covered. Many of my students liked this approach. I used this book for my course on "Computational Discrete Mathematics". My students also liked the fact that they did not have to pay any money to use the book. Discrete Math is usually the first course where the students come across theorems and proofs. Many students find them to be hard to comprehend. However, the approach taken by this author is excellent. He goes through the proofs in much more details than most of the other books on this topic. This really helps the students to understand the material well. It is preparing the students to take more proof intensive courses such as Linear Algebra.

I did not find any mistake in the book. A very well edited book

Discrete Math has applications in many areas including computer science, economics, etc. The topics covered in this book have book have been in existence for a long time and I cannot imagine them to become isolate ever.

It is a very well written book. The examples provided are very relevant to the topics covered. The author has provided solutions to several problems in the exercises. I like the part where you can just click on the problem to go to the solution and vice versa.

I don't see any problem with consistency

Since discrete math is composed of several independent topics, usually there is not much of an issue with the arrangement of the topics. However, please note my comment on organization.

The chapters are very well organized. However, I would prefer the number theory chapter to appear earlier in the book so that the number theory concepts and examples can be used throughout the book. When I introduced equivalence relations to my students, I had to explain the congruence relations (to provide a good example) before we covered the number theory chapter.

This is the part I very much like in the book. One can easily move from one part of the book to another. The figures drawn to illustrate graphs etc., are appropriate.

None

It is a math book! Math books are neutral to all cultures!

It is a well written book. The book is geared more towards math majors than non majors. When I used this book in my computational discrete math course, I had to supplement it with several handouts. I am looking forward to use it in my regular discrete math course meant for math majors. Overall, I am glad that I came across this book.

I have not taken discrete mathematics so I am not sure what all the areas are but it's over 400 pages long and seems to cover in good depth the topics that it covers. It appears to have a comprehensive index and it also has a "list of symbols"... read more

I have not taken discrete mathematics so I am not sure what all the areas are but it's over 400 pages long and seems to cover in good depth the topics that it covers. It appears to have a comprehensive index and it also has a "list of symbols" which I would imagine would be very helpful.

It's in its third edition and the author mentions making corrections and thanking others for pointing out errors. I didn't find any errors so I would imagine the book is highly accurate.

These topics are all timeless so I can't imagine this content ever becoming obsolete.

I found the text to be extremely well written. It has a joyful, upbeat, and enthusiastic voice. I found it very engaging and not at all boring. Professor Levin is a talented writer.

The framework seems totally consistent. I don't see any problems. From what I know of the subjects involved, the terminology seems appropriate and consistent

It is possible that the pieces of text could be a little more bite-sized. I notice that section 3.1 which deals with "Propositional Logic" goes from page 199 through page 213. This seems like it might be a long pull for a student. I'm not sure how the book could be reorganized nor do I see anything to be gained from reorganizing. It seems well organized the way that it is.

I think the writing is superlative and very clear and totally logical. I don't see how it can be improved.

The interface is excellent. There are different typefaces and fonts which alert the reader to what is going on. Also, the online version of the book is fantastic. You can click through to anywhere you want to in the book. You can click on certain problems and the solutions are given. It is truly an excellent interface built with a busy student in mind.

No problems at all. I find the author's mechanics very good and his style is a joyful and as stated above enthusiastic.

If we accept the proposition that a book on discrete math needs be inclusive of a variety of races, ethnicities, and backgrounds, the book may fall short on that count. I will say that I found nothing culturally insensitive or offensive in any way in the text. It might make book more interesting to the reader and arresting of his attention if more exotic examples from different lands and cultures were included. It could broaden the reader's mind.

I wish I had time to take Professor's Levin's class and study the book intensively.

Almost every CS program requires students to take a Discrete Mathematics course. The textbook covers most of the topics usually discussed in a Discrete Mathematics course such as Counting Techniques, Recurrence Relations, Set Theory, Logic, Graph... read more

Almost every CS program requires students to take a Discrete Mathematics course. The textbook covers most of the topics usually discussed in a Discrete Mathematics course such as Counting Techniques, Recurrence Relations, Set Theory, Logic, Graph Theory. There is a short section on Number Theory, too. The textbook Index has links to pages where a particular concept/technique is discussed. It replaces a Glossary. List of symbols contains basic notation used in the textbook with the links to corresponding pages. Both versions, pdf and online version of the textbook have an easy and good navigation.

The text is accurate and unbiased. I did not find any errors

The text is relevant in its content and examples. Mathematical concepts and techniques covered in the textbook will only become more relevant in applications.

The text is readable and straightforward. The textbook examples are simple enough and clearly illustrate discussed mathematical concepts. Each section starts with “Investigate” questions that engage and encourage students to participate in a topic discussion.

The text is consistent. Terms, concepts, notations are used consistently throughout the textbook.

The modularity of the text is appropriate. The content is organized by major topics/chapters (Counting, Sequences, …). Each chapter is broken into sections. The topics are not connected and can be used in any order as well as be remixed with any additional resources.

The chapters are well organized. Each chapter starts with “Investigate” questions that initiates discussion. Concept definitions and techniques descriptions are followed by examples illustrating them. There is a set of exercises at the end of each section.

There are just a few images in the text. Graphics used to illustrate set operations and graph theory concepts are well laid out. Some tree and Venn diagrams might be improved.

I did not notice grammatical errors. If there are any, they probably are just a few.

I agree with the other reviewers. The textbook is as culturally relevant as a math textbook could be.

I'd like to thank Dr. Oscar Levin for writing this textbook and contributing to open educational resources. The text is very readable and engaging, with excellent examples and very good exercises. I consider using some of the chapters as additional resource in my Discrete Mathematics courses.

There are many topics in discrete mathematics. This book does a fine job of covering numerous topics in this area, including among several other topics, symbolic logic, counting, sets, and a short section on number theory. There is very good... read more

There are many topics in discrete mathematics. This book does a fine job of covering numerous topics in this area, including among several other topics, symbolic logic, counting, sets, and a short section on number theory. There is very good index that links to pages in the text. I did not find a glossary, but because the index links to the text, that is not really necessary. There is clearly enough material here for a very meaty undergraduate course.

I found no errors in the text and found no bias of any kind in the text.

This subject is essentially timeless because the principles are mathematical and will always be true and valid. There is one problem involving Continental Airlines that no longer exists, but that is a minor quibble. This does not make the text obsolete.

This is the book's strongest suit. It is written in an upbeat enthusiastic style that comes through. The reader can tell that the author is an energetic teacher who genuinely enjoys the subject. The prose is clear and inviting to the reader. The "Investigate!" sections at the beginning of each lesson are designed to and do pique the student's curiosity.

There are no problems here at all. The book uses terms and concepts consistently throughout the book/

Actually I think the book could be improved with more headings and subheadings to help the reader understand where the next paragraph or section is going. Since the topics do not necessarily build on one another, I think it would be possible to reorganize the text to build a course which would deal only with selected topics. There is not excessive self-reference within the book. I think an instructor would be able to pick and choose among the topics without much trouble.

All topics are introduced by an "Investigate!" section which has the reader puzzle over a problem or set of problems. These "Investigate!" sections are tremendous and whet the reader's appetite for what follows. The problems are of varying degrees of difficultly and many are quite thought provoking. The book has a nice logical flow.

Some modern textbooks have many more pictures, sidebars, and bells and whistles. This book does not have a lot of that, but the limited numbers of illustrations are clear and do not confuse the reader. The links from the index are excellent. This reviewer tends to think that a lot of textbooks simply distract the reader with all of the pictures and sidebars. The book has a simple clear interface. It is not a fancy book and it does not need to be.

I found no grammar errors.

The book is not culturally insensitive or offensive in any way. I note that one of the problems refers to a Christmas party. Maybe there should be references to other religious parties or traditions. it is a math book about discrete mathematics so it is difficult to work in examples that include other races, ethnicities or backgrounds, but with a little creativity such examples could probably be included.

The best thing about this book is the clear tone of enthusiasm for the subject that comes through loud and clear. The tone is infectious and I found myself as I read the book feeling as if I were in a lecture hall attentively listening to the author, Oscar Levin. There is an informality to the book which does not sacrifice any rigor. This is a definite plus. I was very impressed with this book.

This textbook, “Discrete Mathematics: An Open Introduction”, by Oscar Levin, provides a good overview of topics in Discrete Mathematics. The primary focus of this text is not to provide a rigorous mathematical foundation for Computer Science... read more

This textbook, “Discrete Mathematics: An Open Introduction”, by Oscar Levin, provides a good overview of topics in Discrete Mathematics. The primary focus of this text is not to provide a rigorous mathematical foundation for Computer Science students; instead, it is targeted towards first and second year undergraduate math majors who will go on to teach middle school and high school mathematics.

The text starts with a brief but useful introduction to mathematical concepts (mathematical statements, sets and functions), and then goes on to cover a range of topics in depth, broken up into four main sections: Combinatorics, Sequences, Symbolic Logic and Proofs, and Graph Theory, as well an Additional Topics section that touches on Generating Functions and provides an introduction to Number Theory. The material touches on a wide array of concepts such as the Pigeonhole principle,

The text has several features that I found quite innovative and helpful. The presentation takes an inquiry-based approach, and most topics start with an “Investigate!” section that poses a number of questions or problems to help motivate students to understand the context for the topic they’re about to start – for example, the Combinatorial Proofs topic is preceded by an Investigate! Section that uses the Stanley cup tournament rules to make students think about how many ways a team can win, and how to generalize the problem space. The text also approaches mathematical proofs in a friendly, non-intimidating manner and provides different approaches to proving a given identity or theorem, helping students to broaden their mathematical toolkit.

The text has a comprehensive index, and has both a PDF version and a well-designed interactive online format, with a contents tab and expandable solutions (allowing students to attempt a question before unveiling the solution).

The material in the book was well-edited and proof-read. I didn’t encounter obvious mistakes or omissions in my first reading of the text, and only a few typos (e.g. “bijectitve”).

The content of this text is relevant to current undergraduate courses in Discrete Mathematics, particularly for those students intending to pursue careers in middle and high school education. The topics are of fundamental, enduring importance, and not subject to obsolescence.

The author writes clearly and successfully manages to make the subject material approachable, interesting and comprehensible, while not shirking from exploring the more complex aspects of each topic. Mathematical proofs are exceptionally well explained, focusing on helping students understand why an identity is true rather than merely the mechanical aspects of stepping through a number of steps in a proof that may lead to losing sight of the forest for the trees.

There are a few places where additional editing might improve clarity, but overall, the quality of the writing is commendable.

The text is well organized and structured, the terminology used is consistent and pedagogically sound, and the overall presentation is designed so that students find that each topic is presented in a logical, evolutionary manner.

Within the constraints of the subject matter, where topics frequently require understanding of preceding concepts, the text is organized in a reasonably modular fashion. The online interactive format is particularly engaging and likely, in my opinion, to be found useful by students.

The text is well organized and structured, allowing the material to flow and be built up in an accessible manner. The use of the introductory Investigate! sections through-out the text is an excellent tool to motivate students to think about topics before getting into the details.

The book’s design and interface is well-thought out, particularly the interactive online version, which is cleanly designed, non-distracting, functional and approachable, with simple and straight-forward navigational controls.

I found the writing to be high-quality, well-proofed, and free of grammatical issues.

Given the nature of the text’s material, cultural relevance is not a major concern. However, the examples used in the text appeared to be appropriate, without any cultural or gender stereo-typing.

I found this text to be well written and structured, and will be considering using it as the text for a Discrete Mathematics course that I teach.

## Table of Contents

0 Introduction and Preliminaries 1

- 0.1 What is Discrete Mathematics?
- 0.2 Mathematical Statements
- 0.3 Sets

1 Counting

- 1.1 Additive and Multiplicative Principles
- 1.2 Binomial Coefficients
- 1.3 Combinations and Permutations
- 1.4 Combinatorial Proofs
- 1.5 Stars and Bars
- 1.6 Advanced Counting Using PIE
- 1.7 Chapter Summary

2 Sequences

- 2.1 Definitions
- 2.2 Arithmetic and Geometric Sequences
- 2.3 Polynomial Fitting
- 2.4 Solving Recurrence Relations
- 2.5 Induction
- 2.6 Chapter Summary

3 Symbolic Logic and Proofs

- 3.1 Propositional Logic
- 3.2 Proofs
- 3.3 Chapter Summary

4 Graph Theory

- 4.1 Definitions
- 4.2 Trees
- 4.3 Planar Graphs
- 4.4 Coloring
- 4.5 Euler Paths and Circuits
- 4.6 Matching in Bipartite Graphs
- 4.7 Chapter Summary

5 Additional Topics

- 5.1 Generating Functions
- 5.2 Introduction to Number Theory

## Ancillary Material

## About the Book

*Discrete Mathematics: An Open Introduction *is a free, open source textbook appropriate for a first or second year undergraduate course for math majors, especially those who will go on to teach. The textbook has been developed while teaching the Discrete Mathematics course at the University of Northern Colorado. Primitive versions were used as the primary textbook for that course since Spring 2013, and have been used by other instructors as a free additional resource. Since then it has been used as the primary text for this course at UNC, as well as at other institutions.

## About the Contributors

### Author

**Oscar Levin** is an Associate Professor at the University of Northern Colorado in the School of Mathematical Sciences. He has taught mathematics at the college level for over 10 years and has received multiple teaching awards. He received his Ph.D. in mathematics from the University of Connecticut in 2009.