From the set of numbers x, y, t, z, s and w, how many different combinations can we have without the t in them? Ex:. (x,y), (x), (w,z,y,x,s), etc and (x,y)=(y,x)\nOptions:\n(A) 10\n(B) 14\n(C) 15\n(D) 16\n(E) 31 Hmmm, my stream of consciousness:
User
Another way: Any letter (x, y, z, w, s) can be included or not. So, we have 2^5 combinations - 1 empty combination = 31 combinations So, the answer is (E).
Assistant