SOLVER7 Study. Nothing Else.
Exercise 1.1 Q6

Match each of the set on the left in the roster form with the same set on the right described in set-builder form:
\((i)\{1, 2, 3, 6\}\) \((a)\{x : x\) is a prime number and a divisor of \(6\}\)
\((ii)\{2,3\}\) \((b)\{x : x\) is an odd natural number less than \(10\}\)
\((iii)\{M,A,T,H,E,I,C,S\}\) \((c)\{x : x\) is natural number and divisor of \(6\}\)
\((iv)\{1,3,5,7,9\}\) \((d)\{x : x\) is a letter of the word \(MATHEMATICS\}\)

CBSE Class 11 Maths · Sets

Solution

👶 Simple Explanation

Simple Explanation

Imagine a set as a bag of items. One bag shows you the items directly, like a bag holding \( 1, 2, 3, 6 \). Another bag has a label saying 'all natural numbers that divide 6.' Both bags hold the same items! Matching them is like reading a label, figuring out what goes inside, and checking if it matches the open bag. Once you decode each label and list its items, the match becomes obvious. It is just like matching a recipe description to the finished dish.

Answer: \( (i) \leftrightarrow (c) \), \( (ii) \leftrightarrow (a) \), \( (iii) \leftrightarrow (d) \), \( (iv) \leftrightarrow (b) \).

📖 Matching Roster Form with Set-Builder Form

Detailed Explanation

A set can be written in two main ways. In roster form, we list all the elements inside braces, for example \( \{1, 2, 3\} \). In set-builder form, we describe a common property of the elements, for example \( \{x : x \text{ is a natural number less than } 4\} \). To match a roster set with a set-builder set, we decode each set-builder description, list the elements it produces, and compare that list with the roster sets. Two sets are equal when they contain exactly the same elements, regardless of order or repetition.

Formula Used

Roster form: list elements as \( \{a, b, c, \dots\} \). Set-builder form: \( \{x : x \text{ satisfies a property}\} \).

Solution

  1. Step 1: Decode option (c): \( \{x : x \text{ is a natural number and divisor of } 6\} \). The natural numbers that divide 6 are 1, 2, 3 and 6. So this set is \( \{1, 2, 3, 6\} \). This exactly matches set (i).
  2. Step 2: Decode option (a): \( \{x : x \text{ is a prime number and a divisor of } 6\} \). The divisors of 6 are 1, 2, 3, 6, and among these the prime numbers are 2 and 3. So this set is \( \{2, 3\} \). This exactly matches set (ii).
  3. Step 3: Decode option (d): \( \{x : x \text{ is a letter of the word } MATHEMATICS\} \). Writing the distinct letters (each letter counted only once): M, A, T, H, E, I, C, S. So this set is \( \{M, A, T, H, E, I, C, S\} \). This exactly matches set (iii).
  4. Step 4: Decode option (b): \( \{x : x \text{ is an odd natural number less than } 10\} \). The odd natural numbers below 10 are 1, 3, 5, 7 and 9. So this set is \( \{1, 3, 5, 7, 9\} \). This exactly matches set (iv).
  5. Step 5: Combine all matches from the previous steps to write the final pairing of roster sets with their set-builder descriptions.

Final Answer

\( (i) \leftrightarrow (c) \), \( (ii) \leftrightarrow (a) \), \( (iii) \leftrightarrow (d) \), \( (iv) \leftrightarrow (b) \).

Common Mistake

A common mistake is repeating letters when listing the set for the word MATHEMATICS, for example writing M and A twice. In a set, each distinct element is written only once, so \( \{M, A, T, H, E, I, C, S\} \) has just 8 elements.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Decode option (c): \( \{x : x \text{ is a natural number and a divisor of } 6\} \). The natural number divisors of 6 are 1, 2, 3, and 6, so this set in roster form is \( \{1, 2, 3, 6\} \). — Reason: Listing all divisors converts the set-builder description into roster form so we can compare it directly with the given roster sets. This matches set (i).
  2. Step 2: Decode option (a): \( \{x : x \text{ is a prime number and a divisor of } 6\} \). The divisors of 6 are 1, 2, 3, and 6; among these, only 2 and 3 are prime. So this set in roster form is \( \{2, 3\} \). — Reason: Applying both conditions (divisor of 6 AND prime) narrows the elements to exactly those satisfying both. This matches set (ii).
  3. Step 3: Decode option (d): \( \{x : x \text{ is a distinct letter of the word MATHEMATICS}\} \). Writing MATHEMATICS letter by letter — M, A, T, H, E, M, A, T, I, C, S — and keeping only distinct letters gives \( \{M, A, T, H, E, I, C, S\} \). — Reason: In sets, repeated elements are listed only once, so duplicates (M, A, T appear twice in the word) are removed. This matches set (iii).
  4. Step 4: Decode option (b): \( \{x : x \text{ is an odd natural number less than } 10\} \). The odd natural numbers below 10 are 1, 3, 5, 7, and 9, so this set in roster form is \( \{1, 3, 5, 7, 9\} \). — Reason: Systematically listing every odd natural number under 10 converts the description into roster form. This matches set (iv).
  5. Step 5: Compile all four matches: (i) \( \leftrightarrow \) (c), (ii) \( \leftrightarrow \) (a), (iii) \( \leftrightarrow \) (d), (iv) \( \leftrightarrow \) (b). — Reason: After decoding each set-builder option and comparing element by element, every roster set is paired with its unique set-builder counterpart.

Final Answer

\( (i) \leftrightarrow (c) \), \( (ii) \leftrightarrow (a) \), \( (iii) \leftrightarrow (d) \), \( (iv) \leftrightarrow (b) \).

Common Mistake

One common mistake: forgetting to remove duplicate letters when decoding a set of letters in a word — for example, writing M or A twice for the word MATHEMATICS, which is incorrect because sets never repeat elements.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Option (c): Natural divisors of 6 are \ \(\{1, 2, 3, 6\}\) → matches (i).
  2. Step 2: Option (a): Prime divisors of 6 are \ \(\{2, 3\}\) → matches (ii).
  3. Step 3: Option (d): Distinct letters of MATHEMATICS are \ \(\{M, A, T, H, E, I, C, S\}\) → matches (iii).
  4. Step 4: Option (b): Odd natural numbers less than 10 are \ \(\{1, 3, 5, 7, 9\}\) → matches (iv).

Answer: \( (i) \leftrightarrow (c) \), \( (ii) \leftrightarrow (a) \), \( (iii) \leftrightarrow (d) \), \( (iv) \leftrightarrow (b) \).

➕ More Examples

More Examples

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)

🎯 Try a Similar Question

Try a Similar Question

Question: Match each set on the left (given in roster form) with the same set on the right (described in set-builder form): (i) \( \{2, 4, 6, 8, 10\} \) — (a) \( \{x : x \in \mathbb{N} \text{ and } x \text{ is a divisor of } 12\} \) (ii) \( \{1, 2, 3, 4, 6, 12\} \) — (b) \( \{x : x \text{ is a prime number and } x < 10\} \) (iii) \( \{2, 3, 5, 7\} \) — (c) \( \{x : x \text{ is a letter of the word } SCHOOL\} \) (iv) \( \{S, C, H, O, L\} \) — (d) \( \{x : x \text{ is an even natural number and } x \le 10\} \)

Solution

  1. Step 1: Analyse set (i): Set (i) in roster form is \( \{2, 4, 6, 8, 10\} \). These are the even natural numbers up to 10. Option (d) says \( \{x : x \text{ is an even natural number and } x \le 10\} \), which gives exactly \( \{2, 4, 6, 8, 10\} \). So (i) matches (d).
  2. Step 2: Analyse set (ii): Set (ii) in roster form is \( \{1, 2, 3, 4, 6, 12\} \). These are all the natural number divisors of 12. Checking: \( 12 = 1 \times 12 = 2 \times 6 = 3 \times 4 \), so divisors are \( 1, 2, 3, 4, 6, 12 \). Option (a) says \( \{x : x \in \mathbb{N} \text{ and } x \text{ is a divisor of } 12\} \). So (ii) matches (a).
  3. Step 3: Analyse set (iii): Set (iii) in roster form is \( \{2, 3, 5, 7\} \). These are prime numbers less than 10. Option (b) says \( \{x : x \text{ is a prime number and } x < 10\} \). Prime numbers less than 10 are \( 2, 3, 5, 7 \). So (iii) matches (b).
  4. Step 4: Analyse set (iv): Set (iv) in roster form is \( \{S, C, H, O, L\} \). The word SCHOOL has letters S, C, H, O, O, L. When we collect the distinct letters, we get \( \{S, C, H, O, L\} \). Option (c) says \( \{x : x \text{ is a letter of the word } SCHOOL\} \). So (iv) matches (c).
  5. Step 5: Write the final matching: Combining all the above: (i) matches (d), (ii) matches (a), (iii) matches (b), and (iv) matches (c).

Answer: \( (i) \leftrightarrow (d) \), \( (ii) \leftrightarrow (a) \), \( (iii) \leftrightarrow (b) \), \( (iv) \leftrightarrow (c) \).

Everything you get with Solver7

More questions in Sets