Bunuel
In a certain mathematical activity, we have five cards with five different prime numbers on them. We will distribute these five cards among three envelope: all could go in any envelope, or they could be broken up in any way among the envelopes. Then in each envelop, we find the product of all the cards in that envelope: that is the “number” of the envelope. An envelope containing no cards has the number 1. We then put the three envelope numbers in order, from lowest to highest, and that is our set. How many different sets can be produced by this process?
(A) 41
(B) 89
(C) 125
(D) 243
(E) 512
Kudos for a correct solution.
MAGOOSH OFFICIAL SOLUTION:We have to consider different groupings. First, all the cards together.
Case I: all five cards in one envelope (2 envelopes empty) = one possibility
Now, two envelopes used, one empty.
Case II: four in one, one in another, one empty = five choices for the one by itself = 5 possibilities
Case III: three in one, two in another, one empty = 5C3 = 10 possibilities
Now, no empty envelopes, all three used:
Case IV: 3-1-1 split = 5C3 = 10 possibilities
Case V: 2-2-1 split = 5C2 = 10 for the first pair, then 3 possibilities for the single one, leaving the other two for the pair. This would be 10*3 = 30, but that double-counts the two pairs, so we need to divide by two. 15 possibilities.
N = 1 + 5 + 10 + 10 + 15 = 41
Answer = (A)
. I could not understand these statements and how we used these statements in the solution. Very confusing..please help..