Write the following sets in roster form :
$\mathrm{E} =$ The set of all letters in the world $\mathrm{TRIGONOMETRY}$
$E =$ The set of all letters in the word $TRIGONOMETRY$
There are $12$ letters in the word $TRIGONOMETRY,$ out of which letters $T,$ $R$ and $O$ are repeated
Therefore, this set can be written in roster form as
$E =\{ T , R , I , G , O , N , M , E , Y \}$
Given the sets $A=\{1,3,5\}, B=\{2,4,6\}$ and $C=\{0,2,4,6,8\},$ which of the following may be considered as universal set $(s)$ for all the three sets $A$, $B$ and $C$
$\{0,1,2,3,4,5,6,7,8,9,10\}$
If $A$ and $B$ are any two non empty sets and $A$ is proper subset of $B$. If $n(A) = 4$, then minimum possible value of $n(A \Delta B)$ is (where $\Delta$ denotes symmetric difference of set $A$ and set $B$)
The number of non-empty subsets of the set $\{1, 2, 3, 4\}$ is
Let $A=\{1,2,3,4,5,6\} .$ Insert the appropriate symbol $\in$ or $\notin$ in the blank spaces:
$ 2 \, ....... \, A $
State whether each of the following set is finite or infinite :
The set of numbers which are multiple of $5$