Example 1
Question: A school fair runs a colour-mixing game. Spin Spinner 1 (which has three equal sections: Red (R), Yellow (Y), Blue (B)) and Spinner 2 (which has two equal sections: White (W), Black (K)). A player wins if the result from Spinner 1 is Blue (B) and the result from Spinner 2 is White (W), because Blue and White together make the school's house colour. One outcome is written as (R, W). (i) List ALL possible outcomes of the game. (ii) How many outcomes are there in total? (iii) How many outcomes represent a win?
Solution: Spinner 1 outcomes: \( \{R, Y, B\} \) — three sections. Spinner 2 outcomes: \( \{W, K\} \) — two sections. Total number of outcomes = \( 3 \times 2 = 6 \). Listing every ordered pair (Spinner 1, Spinner 2): \[ S = \{(R,W),\ (R,K),\ (Y,W),\ (Y,K),\ (B,W),\ (B,K)\} \] The winning condition is Spinner 1 shows B AND Spinner 2 shows W. Checking each pair — only \( (B, W) \) satisfies both conditions. Number of winning outcomes = \( 1 \).
Answer: (i) \( \{(R,W),(R,K),(Y,W),(Y,K),(B,W),(B,K)\} \) (ii) 6 outcomes (iii) 1 winning outcome: \( (B,W) \)
Example 2
Question: At a science exhibition stall, two wheels are spun. Wheel 1 has four equal sections: Green (G), Orange (O), Purple (P), Pink (N). Wheel 2 has three equal sections: Silver (S), Gold (D), Bronze (Z). A visitor wins a prize if Wheel 1 lands on Green (G) and Wheel 2 lands on Gold (D), since 'GD' is the winning code. One outcome is recorded as (G, S). (i) List ALL possible outcomes. (ii) Find the total number of outcomes. (iii) List all winning outcomes.
Solution: Wheel 1 outcomes: \( \{G, O, P, N\} \) — four sections. Wheel 2 outcomes: \( \{S, D, Z\} \) — three sections. Total number of outcomes = \( 4 \times 3 = 12 \). Listing every ordered pair (Wheel 1, Wheel 2): \[ S = \{(G,S),\ (G,D),\ (G,Z),\ (O,S),\ (O,D),\ (O,Z),\ (P,S),\ (P,D),\ (P,Z),\ (N,S),\ (N,D),\ (N,Z)\} \] The winning condition requires Wheel 1 = G and Wheel 2 = D. Scanning all 12 pairs, only \( (G, D) \) satisfies the winning condition. Number of winning outcomes = \( 1 \).
Answer: (i) \( \{(G,S),(G,D),(G,Z),(O,S),(O,D),(O,Z),(P,S),(P,D),(P,Z),(N,S),(N,D),(N,Z)\} \) (ii) 12 outcomes (iii) 1 winning outcome: \( (G,D) \)