Discrete Mathematics

Compute Representation of sets Let u = {a_1, a_2, ..., a_n} a finite set of reasonable size represent a subset A of u with a bit string of length n, where the i^th bit in this string is 1 if a_i A and 0 if a_i NotElement A Let u = {1, 2, 3, .., 10}. Express A = {1, 3, 6, 10} with a bit string of length 10 find the subset of u specified by the bit string 01 0111 1000