Discrete Mathematics provides key concepts and a solid, rigorous foundation in mathematical reasoning. Appropriate for undergraduate as well as a starting point for more advanced class, the resource offers a logical progression through key topics without assuming any background in algebra or computational skills and without duplicating what they will learn in higher level courses. The book is designed as an accessible introduction for students in mathematics or computer science as it explores questions that test the understanding of proof strategies, such as mathematical induction.
For students interested to dive into this subject, the text offers a rigorous introduction to mathematical thought through useful examples and exercises.
Provides a class-tested reference used on multiple years
Includes many exercises and helpful guided solutions to aid student comprehension and practice
Appropriate for undergraduate courses and for students with no background in algebra or computational skills
Editorial Reviews
Review
Select Guide Rating
Review
A rigorous introduction to mathematical thought and proof
From the Back Cover
Developed over the authors’ many years teaching the course at WPI, Discrete Mathematics is designed as an accessible introduction for students in mathematics or computer science. This useful text provides key concepts and a solid, rigorous foundation in mathematical reasoning. Appropriate for undergraduate as well as a starting point for more advanced class, the resource offers a logical progression through key topics, without assuming any background in algebra or computational skills– and without duplicating what they will learn in higher level courses.
Uniquely,
Discrete Mathematics explores questions that test the understanding of proof strategies, such as mathematical induction. For students interested to dive into this subject, the text offers a rigorous introduction to mathematical thought through useful examples and exercises
About the Author
Martin Milanič received his Ph.D. from Rutgers University in 2007. After a postdoctoral stay at Bielefeld University, he joined the University of Primorska in Slovenia, where he designed a higher-level course on graph algorithms and has been teaching various courses related to discrete mathematics. His main areas of research are structural and algorithmic graph theory. He has written over 80 papers (with over 100 coauthors). In 2017 he was awarded with Zois Recognition, the Slovenian national award for important achievements in science.
Both Herman and Brigitte Servatius obtained Ph.D. degrees from Syracuse University. Despite the fact that they entered their fifth decade of marriage, they have kept a bit of their individual mathematical identity. Herman’s interests are in geometry, algebra, and computer science, and Brigitte’s interests are in combinatorics and matroids. Their common interest is combinatorial group theory. Brigitte designed a discrete mathematics course at WPI (Worcester Polytechnic Institute, USA) for advanced mathematics students as an alternative to calculus back in 1987. It has grown into a popular course and is now cross-listed in mathematics and computer science. Discrete Mathematics developed over the many years of teaching the course at WPI to our (mostly) engineering students. Our next-generation coauthor ensures freshness.
Wow! eBook
