Discrete Mathematics · Set and Number Theory
Virginia SOL DM.SNT.2
Virginia SOL DM.SNT.2 is part of the Set and Number Theory strand in Discrete Mathematics (Math). Under this Standards of Learning objective, students apply formulas of combinatorics. Below is what DM.SNT.2 covers in plain language, the specific skills it is assessed on, the key concepts to review, and how to practice DM.SNT.2 for the Virginia SOL test.
What SOL DM.SNT.2 means
Apply formulas of combinatorics.
Skills you’ll practice for DM.SNT.2
- 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.
Key concepts covered by DM.SNT.2
- tree diagrams
- independent events
- probability
- Fundamental Counting Principle
- possible outcomes
- combinatorics
- combinations
- binomial coefficient
- subsets
- permutations
- ordered arrangements
- factorial
- pigeonhole principle
- packing problems
- proof techniques
- induction proofs
- mathematical induction
How to study and practice SOL DM.SNT.2
Start with a quick diagnostic to see whether DM.SNT.2 is already solid, then work each skill above with guided notes, flashcards, and SOL-style practice questions. For official released items, see our Virginia SOL practice tests guide and how to study for the SOL test.
Related Discrete Mathematics standards in Set and Number Theory
Frequently asked questions about SOL DM.SNT.2
What is Virginia SOL DM.SNT.2?
SOL DM.SNT.2 is a Discrete Mathematics Standard of Learning in the Set and Number Theory strand. It expects students to apply formulas of combinatorics.
What skills does SOL DM.SNT.2 cover?
SOL DM.SNT.2 is assessed on 6 skills: 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.
What strand of Discrete Mathematics is SOL DM.SNT.2 in?
SOL DM.SNT.2 belongs to the Set and Number Theory reporting strand of the Discrete Mathematics Virginia Standards of Learning.
How do I study and practice for SOL DM.SNT.2?
Start with a diagnostic to see whether DM.SNT.2 is already solid, then work the 6 skills above with guided notes, flashcards, and SOL-style practice questions. For official released items, see the Virginia SOL practice tests guide.