Retired Moderator
Joined: 07 Jun 2014
Posts: 4815
Given Kudos: 0
WE:Business Development (Energy and Utilities)
Re: An inventory of coins contains 100 different coins.
[#permalink]
23 Aug 2018, 07:42
Explanation
This is a classic combinatorics problem in which order doesn’t matter—in fact, the problem states that explicitly. Use the standard “order doesn’t matter” formula:
\(\frac{total!}{in! \times out!}\)
For Quantity A:
\(\frac{100!}{56! \times 44!}\)
Because the numbers are so large, there must be a way to solve the problem without actually simplifying (even with a calculator, this is unreasonable under GRE time limits). Try Quantity B and compare:
\(\frac{100!}{44! \times 56!}\)
The quantities are equal. Note that this will always work—when order doesn’t matter, the number of ways to pick 56 and leave out 44 is the same as the number of ways to pick 44 and leave out 56. Either way, it’s one group of 56 and one group of 44. What actually happens to those groups (being part of a collection, being left out of the collection, etc.) is irrelevant to the ultimate solution.