Problem preview
S-CP.9 Warmup M2-071-A01-V02

Use permutations and combinations to compute probabilities of compound events and solve problems.

Count permutations when order matters

Problem

The three officer roles are distinct, so order matters. Count the assignments using \(8\) choices, then \(7\), then \(6\).

Big Picture

What this problem is really about

Distinct offices make assignments order-sensitive because the same people in different roles form different outcomes. We’ll count the available person for the first role, reduce the pool for each later role, and multiply the three descending counts. Writing the equivalent permutation notation confirms that no person repeats and that role order remains significant.

Inside Gozunta

Turn the preview into practice.

More than a preview

Gozunta lets you study this problem—and more than 10,000 others.

Create targeted learning sessions, use hints, check your answer, read the walkthrough, watch the video, print the work, and track your progress.

Discover Gozunta Try it now
Four variants of this problem type
Curriculum context
Course
Math II
Standard
S-CP.9
Category
Statistics and Probability
Domain
Conditional Probability and the Rules of Probability
Objective
Use permutations and combinations to compute probabilities of compound events and solve problems.
Problem type
Count permutations when order matters