Discrete Mathematics An Open Introduction Oscar Levin
Material type:
TextSeries: Open textbook libraryDistributor: Minneapolis, MN Open Textbook LibraryPublisher: Greeley, CO Oscar Levin [2024]Copyright date: ©2024Edition: 4th EditionDescription: 1 online resourceContent type: - text
- computer
- online resource
- 1534970746
- QA37.3
- QA1
Publication type: Open textbook.
0 Introduction and Preliminaries 1 -- 0.1 What is Discrete Mathematics? -- 0.2 Mathematical Statements -- 0.3 Sets -- 1 Counting -- 1.1 Additive and Multiplicative Principles -- 1.2 Binomial Coefficients -- 1.3 Combinations and Permutations -- 1.4 Combinatorial Proofs -- 1.5 Stars and Bars -- 1.6 Advanced Counting Using PIE -- 1.7 Chapter Summary -- 2 Sequences -- 2.1 Definitions -- 2.2 Arithmetic and Geometric Sequences -- 2.3 Polynomial Fitting -- 2.4 Solving Recurrence Relations -- 2.5 Induction -- 2.6 Chapter Summary -- 3 Symbolic Logic and Proofs -- 3.1 Propositional Logic -- 3.2 Proofs -- 3.3 Chapter Summary -- 4 Graph Theory -- 4.1 Definitions -- 4.2 Trees -- 4.3 Planar Graphs -- 4.4 Coloring -- 4.5 Euler Paths and Circuits -- 4.6 Matching in Bipartite Graphs -- 4.7 Chapter Summary -- 5 Additional Topics -- 5.1 Generating Functions -- 5.2 Introduction to Number Theory
Open access; no subscription required for the linked open-access version. Unrestricted online access star
Discrete Mathematics: An Open Introduction is a free, open source textbook appropriate for a first or second year undergraduate course for math and computer science majors. The book is especially well-suited for courses that incorporate inquiry-based learning. Since Spring 2013, the book has been used as the primary textbook or a supplemental resource at more than 200 colleges and universities around the world (see the partial adoptions list). After many years of development, I am pleased to announce that the 4th edition of Discrete Mathematics: an Open Introduction is now available, here and on Runestone Academy. The new edition brings many improvements and a new organization of content. In particular, the book now starts with logic and proofs, then practices those proofs with graph theory. The second half of the book contains material on counting (with a new "application to probability" section) and sequences. Over the last few years, I have found that students have more success with this arrangement. There is also a stronger emphasis on discrete structures, which should make the book more useful for students in computer science, while still focusing on understanding mathematical concepts essential for math majors and future math teachers.
Attribution-NonCommercial-ShareAlike (licence family recorded by the source; version not supplied in metadata).
https://open.umn.edu/opentextbooks/textbooks/394
Attribution-NonCommercial-ShareAlike
In English.
Description based on print resource
Course allocation: B. Sc. Computer Science.
There are no comments on this title.