Discrete Math · College

Discrete Math, section by section.

7 sections and 44 topics in teaching order. Each topic: read it, flip the flashcards, then test your understanding. Every topic is free.

A

Introduction and preliminaries

What discrete mathematics studies and a first look at its basic structures. · 2 topics

  1. A.1What is discrete mathematics?
  2. A.2A tour of discrete structures
B

Logic and proofs

Reading and building logical statements, then using them to write proofs. · 6 topics

  1. B.1Statements, connectives, and quantifiers
  2. B.2Implications and related statements
  3. B.3Truth tables, equivalence, and deduction
  4. B.4Direct proof, contrapositive, and contradiction
  5. B.5Proofs about sets, functions, and graphs
  6. B.6Logic in computing
C

Graph theory

Dots and connections: trees, planar maps, routes through graphs, and coloring. · 12 topics

  1. C.1What is a graph?
  2. C.2Trees and their properties
  3. C.3Spanning trees
  4. C.4Planar graphs
  5. C.5Euler trails and Hamilton paths
  6. C.6Coloring graphs
  7. C.7Relations and their properties
  8. C.8Equivalence relations and partitions
  9. C.9Matching in bipartite graphs
  10. C.10Weighted graphs and shortest paths
  11. C.11Trees in computing
  12. C.12Partial orders
D

Counting

Counting large collections quickly, and using counts to find probabilities. · 11 topics

  1. D.1Pascal's triangle and the binomial theorem
  2. D.2The sum and product principles
  3. D.3Overlaps and inclusion-exclusion
  4. D.4Combinations and permutations
  5. D.5Counting multisets (stars and bars)
  6. D.6Combinatorial proofs
  7. D.7Counting and probability
  8. D.8Advanced counting: derangements and functions
  9. D.9The pigeonhole principle
  10. D.10Random variables and expected value
  11. D.11Probability in algorithms and security
E

Sequences

Describing number patterns, finding closed formulas, and proving them by induction. · 7 topics

  1. E.1Describing sequences and sums
  2. E.2Arithmetic and geometric sequences
  3. E.3Polynomial sequences
  4. E.4Exponential sequences and solving recurrences
  5. E.5Proof by induction
  6. E.6Strong induction
  7. E.7Recursion and structural induction
F

Discrete structures revisited

A careful second look at sets and functions. · 2 topics

  1. F.1Sets and set operations
  2. F.2Functions: injections, surjections, bijections
G

Additional topics

Generating functions and an introduction to number theory and its uses. · 4 topics

  1. G.1Generating functions
  2. G.2Divisibility and primes
  3. G.3GCD, congruences, and modular arithmetic
  4. G.4Cryptography: number theory at work
★

Unit quizzes and final exam

Question banks with a fresh draw on every attempt. Every quiz is free.

Section order follows Levin's Discrete Mathematics: An Open Introduction (4th ed.) chapter by chapter; topics follow its sections.