Angie F.

Discrete Mathematics

1 year, 6 months ago

Suppose that the universal set is $U=\{1,2,3,4,$ $5,6,7,8,9,10 \} .$ Express each of these sets with bit strings where the $i$ th bit in the string is 1 if $i$ is in the set and 0 otherwise.
a) $\{3,4,5\}$
b) $\{1,3,6,10\}$
c) $\{2,3,4,7,8,9\}$