SOLVER7 Study. Nothing Else.
Exercise 1.1 Q3(iv)

Write the following sets in roster form:
\(D=\{x : x\) is a prime number which is divisor of \(60\}\)

CBSE Class 11 Maths · Sets

Solution

👶 Simple Explanation

Simple Explanation

Think of 60 as a big number you can break into smaller building blocks. Some numbers divide 60 perfectly, leaving no leftover. Among those, we only want the special ones called prime numbers — numbers like 2, 3, and 5 that cannot be broken down further. Just like sorting your toys by colour, we are picking only the prime ones from all the numbers that fit into 60. Those special prime building blocks turn out to be exactly 2, 3, and 5.

Answer: \( D = \{2, 3, 5\} \)

📖 Set D in Roster Form: Prime Divisors of 60

Detailed Explanation

A set can be described in two main ways. Set-builder form states a property that the elements must satisfy, while roster (or tabular) form lists all the actual elements inside curly braces \( \{ \ldots \} \). Here we are given \( D = \{x : x \text{ is a prime number which is a divisor of } 60\} \). To write this in roster form, we must find every number that is both a prime number and a divisor (factor) of 60. A prime number is a natural number greater than 1 that has exactly two factors: 1 and itself. A divisor of 60 is a number that divides 60 exactly, leaving no remainder. So we need the numbers common to both conditions.

Formula Used

Prime factorisation approach: \( 60 = 2^2 \times 3 \times 5 \). The distinct primes appearing here are exactly the prime divisors of 60.

Solution

  1. Step 1: Understand what is required. We need all values of \( x \) that satisfy two conditions at once: \( x \) must be a prime number, and \( x \) must divide 60 exactly.
  2. Step 2: Do the prime factorisation of 60. We break 60 into prime factors: \( 60 = 2 \times 30 \), then \( 30 = 2 \times 15 \), then \( 15 = 3 \times 5 \). Combining these gives \( 60 = 2 \times 2 \times 3 \times 5 \), which we write as \( 60 = 2^2 \times 3 \times 5 \).
  3. Step 3: Identify the distinct prime factors. From \( 60 = 2^2 \times 3 \times 5 \), the prime numbers that appear are \( 2 \), \( 3 \) and \( 5 \). These are exactly the prime numbers that divide 60.
  4. Step 4: Confirm by checking small primes. Check each: \( 60 \div 2 = 30 \) (divides), \( 60 \div 3 = 20 \) (divides), \( 60 \div 5 = 12 \) (divides), \( 60 \div 7 = 8.57\ldots \) (does not divide). So no prime larger than 5 works, and our list \( 2, 3, 5 \) is complete.
  5. Step 5: Write the elements inside curly braces to form the roster. Since the elements are \( 2 \), \( 3 \) and \( 5 \), we get \( D = \{2, 3, 5\} \).

Final Answer

\( D = \{2, 3, 5\} \)

Common Mistake

A common mistake is to list all divisors of 60, such as \( 1, 2, 3, 4, 5, 6 \ldots \), instead of only the prime divisors. Remember that 1 is not prime, and composite factors like 4 and 6 must be excluded because they are not prime numbers.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Read the set-builder definition carefully. We are given \( D = \\{x : x \text{ is a prime number which is a divisor of } 60\\} \). This means every element of D must satisfy two conditions simultaneously: it must be a prime number AND it must divide 60 exactly. — Reason: Understanding both conditions prevents us from accidentally including non-prime divisors like 4, 6, or 10.
  2. Step 2: Begin the prime factorisation of 60 by dividing out the smallest prime, 2. We get \[60 = 2 \times 30\] Then divide 30 by 2 again: \[30 = 2 \times 15\] — Reason: Dividing by the smallest prime at each stage ensures we do not miss any factor.
  3. Step 3: Continue factorising 15. Since 15 is not divisible by 2, try the next prime, 3: \[15 = 3 \times 5\] Both 3 and 5 are prime, so factorisation is complete. — Reason: We stop when every remaining factor is itself a prime number.
  4. Step 4: Combine all the factors found above to write the complete prime factorisation: \[60 = 2 \times 2 \times 3 \times 5 = 2^{2} \times 3 \times 5\] — Reason: Writing it in exponential form makes it easy to read off the distinct prime bases.
  5. Step 5: Read off the distinct prime bases from \( 60 = 2^{2} \times 3 \times 5 \). The distinct primes are \( 2 \), \( 3 \), and \( 5 \). — Reason: Each distinct prime base is a prime that divides 60 exactly, so it belongs to D.
  6. Step 6: Verify each candidate by direct division. Check \( 60 \div 2 = 30 \) (no remainder, and 2 is prime — included). Check \( 60 \div 3 = 20 \) (no remainder, and 3 is prime — included). Check \( 60 \div 5 = 12 \) (no remainder, and 5 is prime — included). Check the next prime \( 7 \): \( 60 \div 7 \approx 8.57 \) (remainder exists — excluded). — Reason: Explicit verification confirms no prime divisor has been missed or incorrectly added.
  7. Step 7: Write the roster form by listing the qualifying elements inside curly braces: \( D = \\{2, 3, 5\\} \). — Reason: In roster form we list every element that satisfies the set-builder condition, separated by commas, with no repetitions.

Final Answer

\( D = \{2, 3, 5\} \)

Common Mistake

One common mistake: Students often include composite divisors of 60 such as 4, 6, 10, 12, or 15 because they only check divisibility and forget to also verify that the number is prime. Both conditions — prime AND divisor — must be satisfied simultaneously.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Prime factorise 60: \[60 = 2^2 \times 3 \times 5\]
  2. Step 2: Distinct prime factors: \( 2, 3, 5 \)
  3. Step 3: Roster form: \( D = \{2, 3, 5\} \)

Answer: \( D = \{2, 3, 5\} \)

➕ More Examples

More Examples

Example 1

Question: Write the following set in roster form: \( E = \{x : x \text{ is a prime number which is a divisor of } 84\} \)

Solution: Step 1: Find all divisors of 84 by prime factorisation. We perform prime factorisation of 84: \[84 = 2 \times 42 = 2 \times 2 \times 21 = 2 \times 2 \times 3 \times 7\] So \( 84 = 2^2 \times 3 \times 7 \). Step 2: List all divisors of 84. The complete list of divisors of 84 is: 1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84. Step 3: Identify which divisors are prime numbers. From the list above: - 1 is NOT prime (a prime must be greater than 1). - 2 is prime. - 3 is prime. - 4 is NOT prime (\( 4 = 2 \times 2 \)). - 6 is NOT prime (\( 6 = 2 \times 3 \)). - 7 is prime. - All remaining divisors (12, 14, 21, 28, 42, 84) are NOT prime. Step 4: Write the set in roster form. The prime divisors of 84 are 2, 3, and 7. \[E = \{2, 3, 7\}\]

Answer: \( E = \{2, 3, 7\} \)

Example 2

Question: Write the following set in roster form: \( F = \{x : x \text{ is a prime number and a divisor of } 90\} \)

Solution: Step 1: Find the prime factorisation of 90. \[90 = 2 \times 45 = 2 \times 3 \times 15 = 2 \times 3 \times 3 \times 5\] So \( 90 = 2 \times 3^2 \times 5 \). Step 2: List all divisors of 90. The complete list of divisors of 90 is: 1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90. Step 3: Identify which divisors are prime numbers. Checking each divisor: - 1 is NOT prime. - 2 is prime. - 3 is prime. - 5 is prime. - 6 is NOT prime (\( 6 = 2 \times 3 \)). - 9 is NOT prime (\( 9 = 3 \times 3 \)). - 10 is NOT prime (\( 10 = 2 \times 5 \)). - 15 is NOT prime (\( 15 = 3 \times 5 \)). - 18, 30, 45, 90 are all NOT prime. Step 4: Write the set in roster form. The prime divisors of 90 are 2, 3, and 5. \[F = \{2, 3, 5\}\]

Answer: \( F = \{2, 3, 5\} \)

🎯 Try a Similar Question

Try a Similar Question

Question: Write the following set in roster form: \ E = \{x : x \text{ is a prime number and a divisor of } 84\}

Solution

  1. Step 1: Find the prime factorisation of 84: We perform prime factorisation of 84 step by step. Dividing by 2: \ \[84 = 2 \times 42\] Dividing 42 by 2: \[42 = 2 \times 21\] Dividing 21 by 3: \[21 = 3 \times 7\] So the complete prime factorisation is: \[84 = 2^2 \times 3 \times 7\]
  2. Step 2: Identify all divisors of 84: The divisors of 84 are all numbers that divide 84 exactly. These are: 1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, and 84.
  3. Step 3: Pick only the prime divisors: From the list of divisors, we select only those that are prime numbers. Checking each: 1 is not prime. 2 is prime. 3 is prime. 4 is not prime (\( 4 = 2 \times 2 \)). 6 is not prime (\( 6 = 2 \times 3 \)). 7 is prime. 12, 14, 21, 28, 42, 84 are all composite. So the prime divisors of 84 are 2, 3, and 7.
  4. Step 4: Write the set in roster form: Listing all prime divisors of 84 within curly braces: \[E = \{2, 3, 7\}\]

Answer: \( E = \{2, 3, 7\} \)

Everything you get with Solver7

More questions in Sets