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

Solve simple compound probability and counting problems using organized reasoning.

Find every simple compound case that matches the target

Problem

The target compound-event probability is \(1/6\). Evaluate Cases 1–6, then report the \(\text{complete}~\text{matching}~\text{set}\).

Case 1. A \(3\text{-}\text{section}\) spinner is followed by a fair \(1\text{--}6\) cube; the event is blue and \(4\).
Case 2. A bag has \(2\) red and \(4\) yellow marbles, then a fair coin is flipped; the event is red and heads.
Case 3. A lunch uses \(1~\text{of}~2~\text{sandwiches}\) and \(1~\text{of}~3~\text{drinks}\); the event is turkey and juice.
Case 4. A fair coin is followed by a fair \(1\text{--}3\) cube; the event is tails and \(2\).
Case 5. A code uses \(1~\text{of}~\text{four}~\text{letters}~{A,~B,~C,~D}\) and \(1~\text{of}~\text{two}~\text{digits}~{1,~2}\); the event is \(C_{2}\).
Case 6. A tree has \(2~\text{equal}~\text{first}~\text{branches}\) and \(3~\text{equal}~\text{second}~\text{branches}\) from each, with \(\text{exactly}~1~\text{of}~6~\text{outcomes}~\text{favorable}\).

Big Picture

What this problem is really about

Evaluate all six cases by the full two-stage event, not by a promising first step. Multiply the stage probabilities when they are independent, or count favorable leaves over total equal leaves when an organizer is given, then compare the reduced result with the target. This common test handles spinners, bags, menus, codes, and trees without changing the meaning of probability.

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