Browse · harp
Printimc
prealgebra intermediate
Problem
Set has elements, and set has elements. What is the smallest possible number of elements in ?
(A)
(B)
(C)
(D)
Solution
will be smallest if is completely contained in , in which case all the elements in would be counted for in . So the total would be the number of elements in , which is .
Final answer
C