Discrete Mathematics: An Open Introduction
| dc.contributor.author | Levin, Oscar | |
| dc.date.accessioned | 2024-12-23T07:13:00Z | |
| dc.date.available | 2024-12-23T07:13:00Z | |
| dc.date.issued | 2016 | |
| dc.description | 414 p. | |
| dc.description.abstract | 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 proofs" 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. An introductory chapter covering mathematical statements, sets, and functions helps students gain familiarity with the language of mathematics, and two additional topics (generating functions and number theory) are also included. While the book began as a set of lecture notes, it now contains a number of features that should support its use as a primary textbook: 473 exercises, including 275 with solutions and another 109 with hints. Exercises range from easy to quite involved, with many problems suitable for homework. Investigate! activities throughout the text to support active, inquiry based learning. A full index and list of symbols. Consistent and helpful page layout and formatting (i.e., examples are easy to identify, important definitions and theorems in boxes, etc.). | |
| dc.identifier.isbn | 9781792901690 | |
| dc.identifier.uri | https://oerrepository.ntt.edu.vn/handle/298300331/500 | |
| dc.language.iso | en | |
| dc.subject | Mathematics | |
| dc.subject | Statistics | |
| dc.subject | Discrete Mathematics | |
| dc.title | Discrete Mathematics: An Open Introduction | |
| dc.type | Book | |
| dcterms.license | Creative Commons Attribution-ShareAlike 4.0 International |