Problem preview
MF.DP.4 Challenge MF-058-A12-V02

Solve simple compound probability and counting problems using organized reasoning.

Find every simple compound case that matches the target

Problem

The target is exactly \(12~\text{possible}~\text{outcomes}\). Evaluate Situations 1–6, then report the \(\text{complete}~\text{matching}~\text{set}\).

Situation 1. ID tags use \(1~\text{of}~4~\text{background}~\text{colors}\) and \(1~\text{of}~3~\text{symbol}~\text{shapes}\).
Situation 2. A tree has \(3~\text{first}~\text{branches}\), each split into \(4~\text{second}~\text{branches}\).
Situation 3. A meal uses \(1~\text{of}~2~\text{entrees}\), \(1~\text{of}~2~\text{sides}\), and \(1~\text{of}~3~\text{drinks}\).
Situation 4. A \(6\text{-}\text{section}\) spinner is followed by a fair coin.
Situation 5. A locker code uses \(1~\text{of}~3~\text{letters}~{M,~N,~P}\) and \(1~\text{of}~5~\text{digits}~{1,~2,~3,~4,~5}\).
Situation 6. A table contains \(\text{all}~\text{combinations}\) of \(2~\text{shirts}\) and \(6~\text{shorts}\).

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
Standard
MF.DP.4
Category
Data and Probability
Domain
Probability
Objective
Solve simple compound probability and counting problems using organized reasoning.
Problem type
Find every simple compound case that matches the target