(i) By the fundamental principle, n(S)=3×4×2=24. The complement A′ is "letter Q or R and digit odd": 2×2×2=8 codes. So n(A)=24−8=16.
(ii) A∪B fails when the letter is not P, the digit is odd, and the digit is at most 2, that is, letter Q or R with digit 1, in either colour:
(A∪B)′={Q1-red,Q1-green,R1-red,R1-green},n((A∪B)′)=4
Directly, A′ (letter Q or R, digit 1 or 3) together with B′ (digit 1 or 2) leaves letter Q or R with digit 1: n(A′∩B′)=2×1×2=4, as De Morgan's law says.
(iii) A∩B′∩C: digit 1 or 2, red, and (P or even digit). That is P1-red, P2-red, Q2-red, R2-red, so n(A∩B′∩C)=4.
Exactly one event: list the codes in only one of A, B, C.
| Only | Codes | Count |
|---|
| A | P1-green, P2-green, Q2-green, R2-green | 4 |
| B | Q3-green, R3-green | 2 |
| C | Q1-red, R1-red | 2 |
So 8 codes, and the probability is 248=31.