Example 1
Question: Match each set on the left (Roster form) with the correct set on the right (Set-builder form): (i) \(\{2, 3, 5, 7\}\) (ii) \(\{1, 4, 9, 16, 25\}\) (iii) \(\{A, L, G, E, B, R\}\) (iv) \(\{1, 2, 4, 8, 16\}\) (a) \(\{x : x \text{ is a letter of the word } ALGEBRA\}\) (b) \(\{x : x = 2^n,\; n \in \mathbb{N} \cup \{0\},\; 0 \le n \le 4\}\) (c) \(\{x : x \text{ is a prime number less than } 10\}\) (d) \(\{x : x = n^2,\; n \in \mathbb{N},\; 1 \le n \le 5\}\)
Solution: Analyse each set-builder description: Description (c): \(\{x : x \text{ is a prime number less than } 10\}\) Prime numbers less than 10 are 2, 3, 5, 7. So this set in roster form is \(\{2, 3, 5, 7\}\), which matches (i). Description (d): \(\{x : x = n^2,\; n \in \mathbb{N},\; 1 \le n \le 5\}\) For \(n = 1, 2, 3, 4, 5\) we get \(x = 1, 4, 9, 16, 25\). So this set is \(\{1, 4, 9, 16, 25\}\), which matches (ii). Description (a): \(\{x : x \text{ is a letter of the word } ALGEBRA\}\) The word ALGEBRA has letters A, L, G, E, B, R, A. Removing the repeated A, the distinct letters are \(\{A, L, G, E, B, R\}\), which matches (iii). Description (b): \(\{x : x = 2^n,\; n \in \mathbb{N} \cup \{0\},\; 0 \le n \le 4\}\) For \(n = 0, 1, 2, 3, 4\) we get \(x = 1, 2, 4, 8, 16\). So this set is \(\{1, 2, 4, 8, 16\}\), which matches (iv). Final Matching: (i) ↔ (c), (ii) ↔ (d), (iii) ↔ (a), (iv) ↔ (b).
Answer: (i) ↔ (c), (ii) ↔ (d), (iii) ↔ (a), (iv) ↔ (b)
Example 2
Question: Match each set on the left (Roster form) with the correct set on the right (Set-builder form): (i) \(\{1, 3, 7, 21\}\) (ii) \(\{2, 5\}\) (iii) \(\{R, E, A, S, O, N, I, G\}\) (iv) \(\{0, 1, 8, 27, 64\}\) (a) \(\{x : x \text{ is a prime divisor of } 10\}\) (b) \(\{x : x = n^3,\; n \in \mathbb{N} \cup \{0\},\; 0 \le n \le 4\}\) (c) \(\{x : x \text{ is a natural number and a divisor of } 21\}\) (d) \(\{x : x \text{ is a letter of the word } REASONING\}\)
Solution: Analyse each set-builder description: Description (c): \(\{x : x \text{ is a natural number and a divisor of } 21\}\) Divisors of 21 are the natural numbers that divide 21 exactly. Since \(21 = 1 \times 21 = 3 \times 7\), the divisors are 1, 3, 7, 21. So this set is \(\{1, 3, 7, 21\}\), which matches (i). Description (a): \(\{x : x \text{ is a prime divisor of } 10\}\) Prime factorisation of 10: \(10 = 2 \times 5\). The prime divisors are 2 and 5. So this set is \(\{2, 5\}\), which matches (ii). Description (d): \(\{x : x \text{ is a letter of the word } REASONING\}\) The word REASONING has letters R, E, A, S, O, N, I, N, G. Removing the repeated N, the distinct letters are \(\{R, E, A, S, O, N, I, G\}\), which matches (iii). Description (b): \(\{x : x = n^3,\; n \in \mathbb{N} \cup \{0\},\; 0 \le n \le 4\}\) For \(n = 0, 1, 2, 3, 4\) we get \(x = 0, 1, 8, 27, 64\). So this set is \(\{0, 1, 8, 27, 64\}\), which matches (iv). Final Matching: (i) ↔ (c), (ii) ↔ (a), (iii) ↔ (d), (iv) ↔ (b).
Answer: (i) ↔ (c), (ii) ↔ (a), (iii) ↔ (d), (iv) ↔ (b)