A computer is printing out subsets of a 6 element set (possibly including the empty set). (a) At least how many sets must be printed to be sure of having at least 3 identical subsets on the list? Answer = (3*6!)+1 (b) At least how many identical subsets are printed if there are 257 subsets on the list?

(a) 129

(b) 5

Step-by-step explanation:

(a) In a set with elements, the number of possible distinct subsets is .

For a 6-element set, this number is .

The minimum for two identical subsets will be 1 + 64 = 65, since 64 already contains all possible subsets. Any extra subset will be identical to one of them.

For three identical subsets, all subsets must have been repeated twice. Any extra is then repeated thrice. Hence, we have 64 × 2 + 1 = 129

(b) With 257 subsets, we first determine how many times each distinct subset could have been repeated by dividing 257 ÷ 64 = 4 with a remainder of 1. This means possibly, all subsets have been repeated 4 times. The extra 1 makes it a fifth time for one of them. So, the minimum number of identical subsets is 5.

c: y > - 1/6x + 1

step-by-step explanation:

dashed line - meaning this < or > also not equal

solid line - meaning this < or > also equal

your answer is c because y > means up & it's shaded up, but y < means down

hope this ! : )