Processing math: 100%
Skip to main content
Discrete Mathematics:
An Open Introduction, 3rd edition
Oscar Levin
Contents
Index
Prev
Up
Next
Contents
Prev
Up
Next
Front Matter
Colophon
Dedication
Acknowledgements
Preface
How to use this book
0
Introduction and Preliminaries
What is Discrete Mathematics?
Mathematical Statements
Sets
Functions
1
Counting
Additive and Multiplicative Principles
Binomial Coefficients
Combinations and Permutations
Combinatorial Proofs
Stars and Bars
Advanced Counting Using PIE
Chapter Summary
2
Sequences
Describing Sequences
Arithmetic and Geometric Sequences
Polynomial Fitting
Solving Recurrence Relations
Induction
Chapter Summary
3
Symbolic Logic and Proofs
Propositional Logic
Proofs
Chapter Summary
4
Graph Theory
Definitions
Trees
Planar Graphs
Coloring
Euler Paths and Circuits
Matching in Bipartite Graphs
Chapter Summary
5
Additional Topics
Generating Functions
Introduction to Number Theory
Backmatter
A
Selected Hints
B
Selected Solutions
C
List of Symbols
Index
Colophon
Authored in PreTeXt
permalink
Front Matter
0
Introduction and Preliminaries
1
Counting
2
Sequences
3
Symbolic Logic and Proofs
4
Graph Theory
5
Additional Topics
Backmatter
login