🎯

Learning Goal

‹3 of 3 in this skill_area

Combinations

Start lessonBegins with Combinations · Slides

Teacher tools for this standard

Lesson Plan · Guided Notes · Exit Ticket · Re-teach · Homework

S 405. Exhibit knowledge of simple counting techniques S 603. Apply counting techniques

Show more

S 405. Exhibit knowledge of simple counting techniques
S 603. Apply counting techniques

What you'll learn

  1. Solve applied counting problems (committees, teams, selections, hands of cards) by deciding whether order matters and, for an unordered selection, counting with C(n,r)
  2. Determine whether a problem requires permutations or combinations by asking "does order matter?"
  3. Compute C(n,r) = n!/(r!(n-r)!) to count the ways to choose r items from n when order does not matter
  4. Explain why C(n,r) = P(n,r)/r!: each selection of r items appears r! times among the permutations, so combinations count fewer arrangements than permutations for the same n and r
Review first:

Slides

Step through the lesson, or watch it as a narrated video

1

Combinations

✓ Start here
Watch as video

Practice

Try it on your own

Was this lesson helpful?
Report a problem with this page