, Discrete Mathematics
Discrete Mathematics: An Open Introduction, Fourth Edition aims to provide an introduc-
tion to select topics in discrete mathematics at a level appropriate for first or second year under-
graduate math and computer science majors, especially those who intend to teach middle and
high school mathematics. The book began as a set of notes for the Discrete Mathematics course
at the University of Northern Colorado. This course serves both as a survey of the topics in dis-
crete math and as the “bridge” course for math majors.
Features
• Uses problem-oriented and inquiry-based methods to teach the concepts.
• Suitable for undergraduates in mathematics and computer science.
New to the 4th Edition
• Large scale restructuring.
• Contains more than 750 exercises and examples.
• New sections on probability, relations, and discrete structures and their proofs.
Oscar Levin is a professor at the University of Northern Colorado. He has taught mathemat-
ics and computer science at the college level for over 15 years and has won multiple teaching
awards. His research studies the interaction between logic and graph theory, and he is an active
developer on the PreTeXt project, an open-source authoring system for writing accessible schol-
arly documents. He earned his Ph.D. in mathematical logic from the University of Connecticut
in 2009.
Outside of the classroom, Oscar enjoys entertaining his two brilliant daughters with jaw-drop-
ping magic tricks and hilarious Dad jokes, hiking with his amazing wife, and coming in second-
to-last in local pinball tournaments.
,Discrete Mathematics and Its Applications
Series editors:
Miklos Bona, Donald L. Kreher, Douglas B. West
Handbook of Geometric Constraint Systems Principles
Edited by Meera Sitharam, Audrey St. John, Jessica Sidman
Introduction to Chemical Graph Theory
Stephan Wagner, Hua Wang
Extremal Finite Set Theory
Daniel Gerbner, Balazs Patkos
The Mathematics of Chip-Firing
Caroline J. Klivans
Computational Complexity of Counting and Sampling
Istvan Miklos
Volumetric Discrete Geometry
Karoly Bezdek, Zsolt Langi
The Art of Proving Binomial Identities
Michael Z. Spivey
Combinatorics and Number Theory of Counting Sequences
Istvan Mezo
Applied Mathematical Modeling
A Multidisciplinary Approach
Douglas R. Shier, K.T. Wallenius
Analytic Combinatorics
A Multidimensional Approach
Marni Mishna
50 years of Combinatorics, Graph Theory, and Computing
Edited By Fan Chung, Ron Graham, Frederick Hoffman, Ronald C. Mullin, Leslie Hogben, Douglas B. West
Fundamentals of Ramsey Theory
Aaron Robertson
Methods for the Summation of Series
Tian-Xiao He
The Lambert W Function
Its Generalizations and Applications
István Mező
Combinatorics of Permutations, Third Edition
Miklos Bona
Topics in Graph Theory
Mark Anderson, Jonathan Gross and Jay Yellen
Applied Combinatorics, Third Edition
Fred S. Roberts and Barry Tesman
Discrete Mathematics
An Open Introduction, Fourth Edition
Oscar Levin
https://www.routledge.com/Discrete-Mathematics-and-Its-Applications/book-series/CHDISMTHAPP
,
Discrete Mathematics: An Open Introduction, Fourth Edition aims to provide an introduc-
tion to select topics in discrete mathematics at a level appropriate for first or second year under-
graduate math and computer science majors, especially those who intend to teach middle and
high school mathematics. The book began as a set of notes for the Discrete Mathematics course
at the University of Northern Colorado. This course serves both as a survey of the topics in dis-
crete math and as the “bridge” course for math majors.
Features
• Uses problem-oriented and inquiry-based methods to teach the concepts.
• Suitable for undergraduates in mathematics and computer science.
New to the 4th Edition
• Large scale restructuring.
• Contains more than 750 exercises and examples.
• New sections on probability, relations, and discrete structures and their proofs.
Oscar Levin is a professor at the University of Northern Colorado. He has taught mathemat-
ics and computer science at the college level for over 15 years and has won multiple teaching
awards. His research studies the interaction between logic and graph theory, and he is an active
developer on the PreTeXt project, an open-source authoring system for writing accessible schol-
arly documents. He earned his Ph.D. in mathematical logic from the University of Connecticut
in 2009.
Outside of the classroom, Oscar enjoys entertaining his two brilliant daughters with jaw-drop-
ping magic tricks and hilarious Dad jokes, hiking with his amazing wife, and coming in second-
to-last in local pinball tournaments.
,Discrete Mathematics and Its Applications
Series editors:
Miklos Bona, Donald L. Kreher, Douglas B. West
Handbook of Geometric Constraint Systems Principles
Edited by Meera Sitharam, Audrey St. John, Jessica Sidman
Introduction to Chemical Graph Theory
Stephan Wagner, Hua Wang
Extremal Finite Set Theory
Daniel Gerbner, Balazs Patkos
The Mathematics of Chip-Firing
Caroline J. Klivans
Computational Complexity of Counting and Sampling
Istvan Miklos
Volumetric Discrete Geometry
Karoly Bezdek, Zsolt Langi
The Art of Proving Binomial Identities
Michael Z. Spivey
Combinatorics and Number Theory of Counting Sequences
Istvan Mezo
Applied Mathematical Modeling
A Multidisciplinary Approach
Douglas R. Shier, K.T. Wallenius
Analytic Combinatorics
A Multidimensional Approach
Marni Mishna
50 years of Combinatorics, Graph Theory, and Computing
Edited By Fan Chung, Ron Graham, Frederick Hoffman, Ronald C. Mullin, Leslie Hogben, Douglas B. West
Fundamentals of Ramsey Theory
Aaron Robertson
Methods for the Summation of Series
Tian-Xiao He
The Lambert W Function
Its Generalizations and Applications
István Mező
Combinatorics of Permutations, Third Edition
Miklos Bona
Topics in Graph Theory
Mark Anderson, Jonathan Gross and Jay Yellen
Applied Combinatorics, Third Edition
Fred S. Roberts and Barry Tesman
Discrete Mathematics
An Open Introduction, Fourth Edition
Oscar Levin
https://www.routledge.com/Discrete-Mathematics-and-Its-Applications/book-series/CHDISMTHAPP
,
