06-10-2026, 08:47 PM
Discrete Mathematics: An Open Introduction
by Oscar Levin.
Summary
Four main topics of this book: combinatorics (the theory of ways things combine and how to count these ways), sequences, symbolic logic, and graph theory. This new edition 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. There's 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.
BOOK PAGE
by Oscar Levin.
Summary
Four main topics of this book: combinatorics (the theory of ways things combine and how to count these ways), sequences, symbolic logic, and graph theory. This new edition 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. There's 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.
BOOK PAGE
┌────────────────────────────────┐
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘