Show that the set of letters needed to spell $"\mathrm{CATARACT}"$ and the set of letters needed to spell $"\mathrm{TRACT}"$ are equal.
Show that the set of letters needed to spell $"\mathrm{CATARACT}"$ and the set of letters needed to spell $"\mathrm{TRACT}"$ are equal.
Let $X$ be the set of letters in $"CATARACT".$ Then
$X=\{ C , A , T , R \}$
Let $Y$ be the set of letters in $"TRACT".$ Then
$Y=\{T, R, A, C, T\}=\{T, R, A, C\}$
Since every element in $X$ is in $Y$ and every element in $Y$ is in $X$. It follows that $X = Y$.
Similar Questions
State whether each of the following set is finite or infinite :
The set of animals living on the earth
State whether each of the following set is finite or infinite :
The set of animals living on the earth
State whether each of the following set is finite or infinite :
The set of lines which are parallel to the $x\,-$ axis
State whether each of the following set is finite or infinite :
The set of lines which are parallel to the $x\,-$ axis
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\} $
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\} $
Two finite sets have $m$ and $n$ elements. The total number of subsets of the first set is $56$ more than the total number of subsets of the second set. The values of $m$ and $n$ are
Two finite sets have $m$ and $n$ elements. The total number of subsets of the first set is $56$ more than the total number of subsets of the second set. The values of $m$ and $n$ are
Write the following sets in the set-builder form :
$\{ 2,4,6 \ldots \} $
Write the following sets in the set-builder form :
$\{ 2,4,6 \ldots \} $