1. Express the set:

S = {z _Z|(0 z) ((z mod 6 = 3) (z 3))}

by writing each item in the set (e.g. {1,2,3}). Feel free to use ... for infinite patterns.

Express the set T of all natural numbers whose value divided by 3 is greater than 52 using set builder notation.

2. For each of the sets A, B, C below, write out their powersets by listing the entire set.

A = B = {X} C = {X, Y, Z}

How many elements are in the powerset of the set of the 52 cards which make up the standard playing card deck ({2H,3H,4H,...,QS,KS,AS}) elements? You do not need to enumerate all of these sets.

3. Consider the bit string representation of sets A and B:

A= {sophia, blanche, rose}

B= {rose, sophia}

U dorothy blanche rose sophia

A 0 1 1 1

B 0 0 1 1

For each of sets below:

add a row to the table which gives the bit string representation of the set

(a).A B ;(b). (A B)^C ;(c). (A B)^C A