Write the following sets in the set-builder form : \(\{1,4,9, . . .,100\}\)
CBSE Class 11 Maths · Sets
CBSE Class 11 Maths · Sets
Imagine you are collecting square tiles arranged in a square shape. One tile makes a 1×1 square, four tiles make a 2×2 square, nine tiles make a 3×3 square, and so on. The numbers 1, 4, 9, up to 100 are exactly those tile counts. Instead of listing every number, we describe the whole collection with a simple rule: each number equals some counting number multiplied by itself. The biggest one, 100, comes from 10 times 10. That rule captures all ten numbers at once.
Answer: \( \{1, 4, 9, \ldots, 100\} = \{x : x = n^2, \ n \in \mathbb{N}, \ 1 \le n \le 10\} \)
A set can be written in two main ways. In roster form we list all the elements, like \( \{1, 4, 9, \ldots, 100\} \). In set-builder form we describe the elements using a common property that all of them satisfy, written as \( \{x : x \text{ has some property}\} \), read as 'the set of all \( x \) such that \( x \) satisfies the property'. To convert to set-builder form, we must find the rule that generates every element. Looking at the given set, the numbers are \( 1, 4, 9, \ldots, 100 \). Notice that \( 1 = 1^2 \), \( 4 = 2^2 \), \( 9 = 3^2 \), and \( 100 = 10^2 \). So each element is a perfect square of a natural number, and the last element corresponds to \( n = 10 \).
General set-builder form: \( \{x : x = n^2, \ n \in \mathbb{N}, \ 1 \le n \le 10\} \)
\( \{1, 4, 9, \ldots, 100\} = \{x : x = n^2, \ n \in \mathbb{N}, \ 1 \le n \le 10\} \)
A common mistake is forgetting to restrict the range of \( n \). If you write only \( \{x : x = n^2, \ n \in \mathbb{N}\} \), the set becomes infinite \( \{1, 4, 9, 16, \ldots\} \), which is not equal to the given finite set that stops at \( 100 \). Always include the bound \( 1 \le n \le 10 \).
\( \{1, 4, 9, \ldots, 100\} = \{x : x = n^2, \ n \in \mathbb{N}, \ 1 \le n \le 10\} \)
One common mistake: forgetting to restrict the range of \( n \) and writing \( \{x : x = n^2, \ n \in \mathbb{N}\} \) without the condition \( 1 \le n \le 10 \), which would incorrectly include infinitely many perfect squares beyond 100.
Answer: \( \{1, 4, 9, \ldots, 100\} = \{x : x = n^2, \ n \in \mathbb{N}, \ 1 \le n \le 10\} \)
Question: Write the following set in set-builder form: \( \{2, 8, 18, 32, 50, 72, 98, 128\} \)
Solution: First, observe the elements: \( 2, 8, 18, 32, 50, 72, 98, 128 \). Divide each element by 2: \( 1, 4, 9, 16, 25, 36, 49, 64 \). These are perfect squares: \( 1^2, 2^2, 3^2, 4^2, 5^2, 6^2, 7^2, 8^2 \). So the general element is \( 2n^2 \) where \( n = 1, 2, 3, \ldots, 8 \). Verification for \( n = 1 \): \( 2 \times 1^2 = 2 \). For \( n = 8 \): \( 2 \times 8^2 = 128 \). Both match. Therefore, the set-builder form is \[ \{ x : x = 2n^2,\; n \in \mathbb{N},\; n \le 8 \} \]
Answer: \( \{ x : x = 2n^2,\; n \in \mathbb{N},\; n \le 8 \} \)
Question: Write the following set in set-builder form: \( \left\{ \dfrac{1}{2},\, \dfrac{2}{3},\, \dfrac{3}{4},\, \dfrac{4}{5},\, \dfrac{5}{6} \right\} \)
Solution: Observe the elements: \( \dfrac{1}{2},\, \dfrac{2}{3},\, \dfrac{3}{4},\, \dfrac{4}{5},\, \dfrac{5}{6} \). The numerators are \( 1, 2, 3, 4, 5 \) and the denominators are \( 2, 3, 4, 5, 6 \). Notice that each denominator is one more than its numerator. So the general element is \( \dfrac{n}{n+1} \) where \( n = 1, 2, 3, 4, 5 \). Verification for \( n = 1 \): \( \dfrac{1}{1+1} = \dfrac{1}{2} \). For \( n = 5 \): \( \dfrac{5}{5+1} = \dfrac{5}{6} \). Both match. Therefore, the set-builder form is \[ \left\{ x : x = \frac{n}{n+1},\; n \in \mathbb{N},\; n \le 5 \right\} \]
Answer: \( \left\{ x : x = \dfrac{n}{n+1},\; n \in \mathbb{N},\; n \le 5 \right\} \)
Question: Write the following set in set-builder form: \( \{1, 8, 27, 64, 125, 216\} \).
Answer: \[ \{1, 8, 27, 64, 125, 216\} = \{ x : x = n^3,\ n \in \mathbb{N},\ 1 \le n \le 6 \} \]