SME
College · Engineering
Discrete Mathematics
5 topics
Computer
Before this course
Topics
Logic and proofs
Main lesson
Is the argument valid?
Use this for “If the server is down, the page fails. The page fails. So the server is down. Is this valid?”
Build a truth table
Use this for “Is ¬q → ¬p equivalent to p → q? Build the truth table.”
The steps of a proof by induction
Use this for “Prove that 1 + 2 + … + n = n(n + 1) ÷ 2 for every n ≥ 1.”
Sets and functions
Main lesson
Power set and Cartesian product sizes
Use this for “A has 3 elements and B has 4. How many subsets does A have, and how many ordered pairs are in A × B?”
Counting functions
Use this for “How many functions are there from a 3-element set to a 4-element set, and how many of them are one-to-one?”
One-to-one, onto or both
Use this for “Is f(n) = 2n from ℤ to ℤ one-to-one, onto, both or neither?”
Combinatorics
Main lesson
Identical items into boxes
Use this for “In how many ways can 10 identical balls go into 4 boxes? With at least one in each box?”
The pigeonhole principle
Use this for “Among 50 people, at least how many share a birth month? How many people force 5 in one month?”
Derangements
Use this for “4 letters go into their 4 envelopes at random. In how many ways does no letter reach its own envelope?”
Words with repeated letters
Use this for “How many different words can be made from all 11 letters of MISSISSIPPI?”
Graph theory
Main lesson
Trees and full m-ary trees
Use this for “A full 3-ary tree has 4 internal vertices. How many vertices, leaves and edges?”
Edges of complete graphs
Use this for “How many edges has K₇? How many has the complete bipartite graph K₃,₄?”
Euler circuit, Euler path or neither
Use this for “A connected graph has degrees 3, 3, 2, 2. Does it have an Euler path or an Euler circuit?”
Recurrences
Course test
See what you know: 10 questions on this course
New questions each time. Pass to mark it complete.