Discrete Mathematics: An Open Introduction, 2nd Edition
This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach.
Tag(s): Discrete Mathematics
Publication date: 16 Aug 2016
ISBN-10: 1534970746
ISBN-13: 9781534970748
Paperback: 336 pages
Views: 12,719
Type: Textbook
Publisher: CreateSpace Independent Publishing Platform
License: Creative Commons Attribution-ShareAlike 4.0 International
Post time: 31 Aug 2016 09:50:00
Discrete Mathematics: An Open Introduction, 2nd Edition
This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach.
Publication date: 16 Aug 2016
ISBN-10: 1534970746
ISBN-13: 9781534970748
Paperback: 336 pages
Views: 12,719
Document Type: Textbook
Publisher: CreateSpace Independent Publishing Platform
License: Creative Commons Attribution-ShareAlike 4.0 International
Post time: 31 Aug 2016 09:50:00
Share — copy and redistribute the material in any medium or format
Adapt — remix, transform, and build upon the material for any purpose, even commercially.
The licensor cannot revoke these freedoms as long as you follow the license terms.
Click here to read the full license.
More resources on this textbook and the previous edition are available at the book's webpage.
From the Book Description:
Oscar Levin wrote:This 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 360 exercises, including 230 with solutions and 130 more involved problems suitable for homework. 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.
- It is written to be used in a course for future math teachers.
- It is open source, with low cost print editions and free electronic editions.
Tweet
About The Author(s)
Oscar Levin is an assistant professor of math in the School of Mathematical Sciences at the University of Northern Colorado. His primary interests lie in effective algebra and combinatorics, computability theory, reverse mathematics, and mathematical logic.
Oscar Levin is an assistant professor of math in the School of Mathematical Sciences at the University of Northern Colorado. His primary interests lie in effective algebra and combinatorics, computability theory, reverse mathematics, and mathematical logic.