I don't read too many textbooks that are actual textbooks, but this was a necessary read as I could not quite understand my professor's instructions. The best thing about this book is the clear tone of enthusiasm for the subject that comes through loud and clear. This book covers all the important topics such as set theory, logic, counting techniques, number theory, graph theory etc.

Discrete Mathematics with Applications - Scribd Discrete Mathematics with Applications - Scribd

This textbook, “Discrete Mathematics: An Open Introduction”, by Oscar Levin, provides a good overview of topics in Discrete Mathematics. 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! While in the case of computer image analysis, the algorithms will be applied to represent the images. CENTER FOR OPEN EDUCATION | The Open Education Network is based in the Center for Open Education in the University of Minnesota’s College of Education and Human Development. Since then it has been used as the primary text for this course at UNC, as well as at other institutions.At the same time, the mathematics is not as challenging and inspirational as in most competing textbooks.

Discrete Mathematics with Applications 4th edition by Susanna

The author’s emphasis on reasoning provides a foundation for computer science and upper-level mathematics courses.This title is now available with WebAssign, including innovative new exercise types that guide and assess students' abilities to complete proofs. It appears to have a comprehensive index and it also has a "list of symbols" which I would imagine would be very helpful. Discrete mathematics is used to include theoretical computer science, which is relevant to computing. 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. In contrast, enumerative combinatorics describes the result by using the generating functions and combinatorial formula.

Discrete Mathematics with Applications | Mathematical Discrete Mathematics with Applications | Mathematical

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.

De Morgan’s laws, although important, can be confusing, so be careful when you negate a conjunction or a disjunction. In mathematics, the graph can be used in certain parts of topology, that is, knot theory and in geometry. While I could not be more thrilled that this class is over, Susanna does deserve thanks for this one! When I used this book in my computational discrete math course, I had to supplement it with several handouts. Actually pretty interesting (actually enjoyed taking notes for it, for once), even if a lot of it we didn't actually need in class.