In rule method the null set is represented by
Write the set $A = \{ 1,4,9,16,25, \ldots .\} $ in set-builder form.
If a set $A$ has $n$ elements, then the total number of subsets of $A$ is
The smallest set $A$ such that $A \cup \{1, 2\} = \{1, 2, 3, 5, 9\}$ is
Consider the sets
$\phi, A=\{1,3\}, B=\{1,5,9\}, C=\{1,3,5,7,9\}$
Insert the symbol $\subset$ or $ \not\subset $ between each of the following pair of sets:
$A \ldots C$