Let $S=\{1,2,3, \ldots, 40)$ and let $A$ be a subset of $S$ such that no two elements in $A$ have their sum divisible by 5 . What is the maximum number of elements possible in $A$ ?
Write the following intervals in set-builder form :
$\left[ {6,12} \right]$
List all the elements of the following sers :
$B = \{ x:x$ is an integer $; - \frac{1}{2} < n < \frac{9}{2}\} $
Write the following sets in the set-builder form :
$\{ 3,6,9,12\}$
Let $S=\{1,2,3,4\}$. The total number of unordered pairs of disjoint subsets of $S$ is equal to