So if I'm understanding the question correctly....
Because the Ordering of the "Set" will be chosen based on the Numbers placed in the envelope, we do NOT have to Arrange the Groups. In effect we have 3 "Identical Groups."
This becomes a Question the same as: "How many ways are there to Distribute 5 Distinct Items ------> to 3 Identical Groups, in which the Ordering of the Groups does NOT Matter?"
All that matter is WHICH of the 5 Distinct Items are grouped together and which are NOT grouped together in "Stacks", so to speak.
Case 1: 5 - 0 - 0
1 Way
Case 2: 4 - 1 - 0
We need to choose which 4 of the 5 Distinct Primes will be grouped together in 1 of the "Identical" Envelopes.
For each Unique Distribution, once the 4 are chosen, there will be 1 remaining that will be placed in an envelope.
the Last envelope will have NONE and get the Number "1".
The Set will then automatically be chosen based on our "Stacks" of Prime Numbers
"5 choose 4" ------> 5! / (4!)(1!) = 5 Ways
Case 3: 3 - 2 - 0
We need to choose which 3 of the 5 Distinct Primes will be grouped together in 1 of the "Identical" Envelopes. Once we choose the 3, automatically the 2 will be placed in the 2nd envelope.
"5 Choose 3" -----> 5! / (3!)(2!) = 10 Ways
Case 4: 3 - 1 - 1
Which of the 3 Distinct Primes will be grouped together in 1 Envelope. The other 1 and 1 will automatically be chosen once we choose the 3 for each Unique Distribution and our "Set" will be made.
"5 choose 3" -----> 10 ways
Case 5: 2 - 2 - 1
We will put 2 Primes in 1 Envelope. Then another 2 Primes in a 2nd Envelope.
However, if we just use the Normal Combination Formula (one after another) we will end up over counting, because the Size of the Groupings is the SAME (2 in one envelope and 2 in another envelope).
For Each 2 Distributions we will account for, only 1 will be a Unique Distribution that we want to keep. Therefore, in order to remove the over-counting, we need to Divide by 2!
"5 choose 2" and "3 choose 2" ------> 5! / (3!)(2!) * 3! / (2!)(1!) = 5! / (2!) (2!)
then Divide by 2!
5! / (2!) (2!) * (1 / 2!) = 15 ways
Counting up each scenario:
1 + 5 + 10 + 10 +15 = 41 Ways
-A-