What this paper checks
These three topics give short, sure marks in the objective paper when the method is automatic.
Sets
n(A ∪ B) = n(A) + n(B) − n(A ∩ B)
The ones in both are counted twice when you add, so you take them away once. Anyone in neither is outside both circles: total − n(A ∪ B).
Surds
Take out the largest square factor: √72 = √(36 × 2) = 6√2. Only like surds add: 3√2 + 5√2 = 8√2, but √2 + √3 stays as it is.
To rationalise, multiply top and bottom by the surd: 10/√5 = 10√5/5 = 2√5. And (a + √b)(a − √b) = a² − b, with no surd left.
Modular arithmetic
In modulo n, keep only the remainder after dividing by n. 17 in modulo 5 is 2, because 17 = 3 × 5 + 2.
To solve 2x ≡ 3 (mod 5), try x = 0, 1, 2, 3, 4: 2 × 4 = 8 ≡ 3, so x = 4.
Exam tips
- Fill a Venn diagram from the middle (both) outwards.
- Leave surd answers in their simplest surd form unless asked for a decimal.