Write the following sets in roster form:
\(E=\) The set of all letters in the word \(TRIGONOMETRY\)
CBSE Class 11 Maths · Sets
CBSE Class 11 Maths · Sets
Imagine collecting stickers from the word TRIGONOMETRY. Some stickers repeat — like T, R, and O show up more than once. But in your collection box, you keep only one of each sticker. No duplicates allowed! So you go through every letter and drop it in the box only if it is not already there. At the end, your box has exactly nine unique letters. That special collection is called a set written in roster form.
Answer: \( E = \{T, R, I, G, O, N, M, E, Y\} \)
A set is a well-defined collection of distinct objects. In roster form (also called tabular form), we list all the elements of the set inside curly braces, separated by commas. Two very important rules apply: first, each element is written only ONCE even if it appears many times in the source, because a set never repeats elements; second, the order in which we list the elements does not matter. When the set is formed from the letters of a word, we simply pick out every different letter that appears in that word and list each such letter a single time.
If a collection has repeated members, the set keeps only distinct elements: \( \{a, a, b\} = \{a, b\} \).
\( E = \{T, R, I, G, O, N, M, E, Y\} \)
A common mistake is to write the repeated letters more than once, for example listing T, R, and O twice as in \( \{T, R, I, G, O, N, O, M, E, T, R, Y\} \). In a set, every element must appear only once, so repeated letters should be written a single time.
\( E = \{T, R, I, G, O, N, M, E, Y\} \)
One common mistake: Students write repeated letters more than once, e.g. listing T, R, or O twice, forgetting that a set contains only distinct elements and duplicates must be removed.
Answer: \( E = \{T, R, I, G, O, N, M, E, Y\} \)
Question: Write the following set in roster form: \( F \) = The set of all letters in the word MATHEMATICS.
Solution: First, list every letter in the word MATHEMATICS in order: M, A, T, H, E, M, A, T, I, C, S. Now identify the repeated letters: - M appears at positions 1 and 6, so we keep only one M. - A appears at positions 2 and 7, so we keep only one A. - T appears at positions 3 and 8, so we keep only one T. The distinct letters are: M, A, T, H, E, I, C, S. Therefore, in roster form: \[F = \{M, A, T, H, E, I, C, S\}\]
Answer: \( F = \{M, A, T, H, E, I, C, S\} \)
Question: Write the following set in roster form: \( G \) = The set of all letters in the word ASSASSINATION.
Solution: First, list every letter in the word ASSASSINATION in order: A, S, S, A, S, S, I, N, A, T, I, O, N. Now identify the repeated letters: - A appears at positions 1, 4, and 9, so we keep only one A. - S appears at positions 2, 3, 5, and 6, so we keep only one S. - I appears at positions 7 and 11, so we keep only one I. - N appears at positions 8 and 13, so we keep only one N. The distinct letters are: A, S, I, N, T, O. Therefore, in roster form: \[G = \{A, S, I, N, T, O\}\]
Answer: \( G = \{A, S, I, N, T, O\} \)
Question: Write the following set in roster form: \( F \) = The set of all letters in the word MATHEMATICS.
Answer: \( F = \{M, A, T, H, E, I, C, S\} \)