Write the following sets in roster form:
\(F=\) The set of all letters in the word \(BETTER\)
CBSE Class 11 Maths · Sets
CBSE Class 11 Maths · Sets
Imagine you have a bag of letter tiles spelling BETTER. You pull out each tile one by one: B, E, T, T, E, R. Now, a set is like a special club where no member is allowed in twice. So even though E shows up twice and T shows up twice, each gets only one spot in the club. The unique guests at this club are B, E, T, and R. That is your answer — a tidy little group with no repeats allowed.
Answer: \( F = \{B, E, T, R\} \)
In roster form (also called tabular form), we write a set by listing all its distinct elements inside curly braces \( \{ \} \), separated by commas. A very important property of sets is that each element is written only ONCE, no matter how many times it repeats in the original description. Also, the order in which we write the elements does not matter. When the set is formed from the letters of a word, we look at every letter of the word, but we keep only the different (distinct) letters.
A set in roster form is written as \( \{ \text{distinct elements} \} \), where every element is listed exactly once and order does not matter.
\( F = \{B, E, T, R\} \)
A common mistake is to repeat the letters that occur more than once, for example writing \( F = \{B, E, T, T, E, R\} \). This is wrong because elements of a set must never be repeated; each distinct element is written only once.
\( F = \{B, E, T, R\} \)
One common mistake: writing every letter of BETTER as-is — \( F = \{B, E, T, T, E, R\} \) — without removing the duplicate E and duplicate T. A set must list each element exactly once, so the repeated T and the repeated E must each appear only a single time in the roster.
Answer: \( F = \{B, E, T, R\} \)
Question: Write the following set in roster form: \( G \) = The set of all letters in the word MATHEMATICS.
Solution: Step 1: Write down all the letters of the word MATHEMATICS in order of appearance: M, A, T, H, E, M, A, T, I, C, S. Step 2: Identify the distinct (unique) letters by removing duplicates. The letter M appears twice, A appears twice, and T appears twice. After removing repetitions, the unique letters are: M, A, T, H, E, I, C, S. Step 3: Write the set in roster form by listing each distinct letter exactly once inside curly braces. Therefore, \( G = \{M, A, T, H, E, I, C, S\} \)
Answer: \( G = \{M, A, T, H, E, I, C, S\} \)
Question: Write the following set in roster form: \( H \) = The set of all letters in the word MISSISSIPPI.
Solution: Step 1: Write down all the letters of the word MISSISSIPPI in order of appearance: M, I, S, S, I, S, S, I, P, P, I. Step 2: Identify the distinct (unique) letters by removing duplicates. The letter I appears 4 times, S appears 4 times, and P appears 2 times. After removing repetitions, the unique letters are: M, I, S, P. Step 3: Write the set in roster form by listing each distinct letter exactly once inside curly braces. Therefore, \( H = \{M, I, S, P\} \)
Answer: \( H = \{M, I, S, P\} \)
Question: Write the following set in roster form: G = The set of all letters in the word REMEMBER.
Answer: \( G = \{R, E, M, B\} \)