Problem preview
S-CP.9 Warmup M2-071-A07-V01

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

Find the probability of an ordered outcome using permutation counts

Problem

Count \(26P_{3}\) equally likely no-repeat ordered codes. Express the probability of \(\text{one}\) exact code as \(\text{one}\) favorable outcome over that total.

Big Picture

What this problem is really about

An exact code lives in an ordered sample space, because changing positions creates a different outcome. We’ll count all no-repeat codes with a descending product, express that total as a permutation, identify how many codes match every specified position, and form favorable outcomes over equally likely total outcomes.

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
Find the probability of an ordered outcome using permutation counts