SOL Prep

Set and Number Theory

Virginia SOL DM.SNT.2

Apply formulas of combinatorics.

Study DM.SNT.2 with SOL PrepBack to Discrete Mathematics

What students need to be able to do

  • Create a tree diagram to represent relationships between independent events.
  • Use the Fundamental (Basic) Counting Principle to determine possible outcomes.
  • Determine the number of combinations when selecting r elements from n without regard to order.
  • Determine the number of permutations when ordering r objects from n.
  • Use the pigeonhole principle to solve packing problems and facilitate proofs.
  • Construct a proof by induction using principles of combinatorics.