GRE Prep Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized
for You
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Sep 28Live Online Class with Top GRE Expert Mike Butville
08:00 PM EDT
-10:00 PM EDT
Top scores are possible when you enroll in a powerful GRE course, taught live online + 6 months access to TTP GRE OnDemand video courses included! Class starts Mon/Wed Sept. 28, 2026 - Dec. 9, 2026, 8:00pm-10:00pm EST
An inventory of coins contains 100 different coins.
[#permalink]
05 Aug 2018, 14:53
05 Aug 2018, 14:53
2
Expert Reply
2
Bookmarks
00:00
Question Stats:
69% (00:36) correct
30% (00:53) wrong based on 139 sessions
Hide Show timer Statistics
An inventory of coins contains 100 different coins.
A) Quantity A is greater.
B) Quantity B is greater.
C) The two quantities are equal.
D) The relationship cannot be determined from the information given.
Quantity A |
Quantity B |
The number of possible collections of 56 coins that can be selected (the order of the coins does not matter) |
The number of possible collections of 44 coins that can be selected (the order of the coins does not matter) |
A) Quantity A is greater.
B) Quantity B is greater.
C) The two quantities are equal.
D) The relationship cannot be determined from the information given.
Re: An inventory of coins contains 100 different coins.
[#permalink]
11 Aug 2018, 13:42
11 Aug 2018, 13:42
1
Combinations! Order doesn't matter.
As long as you remember the formula:
N choose K = N!/(K!(N-K)!)
You will quickly solve questions like this.
Option A:
100 choose 56 = 100!(56!(100-56)!) = 100!/(56!44!)
Option B:
100 choose 44 = 100!(44!(100-44)!) = 100!/(44!56!)
So they are equal. Don't try to solve the factorial, as the number of combinations are astronomical.
C.
As long as you remember the formula:
N choose K = N!/(K!(N-K)!)
You will quickly solve questions like this.
Option A:
100 choose 56 = 100!(56!(100-56)!) = 100!/(56!44!)
Option B:
100 choose 44 = 100!(44!(100-44)!) = 100!/(44!56!)
So they are equal. Don't try to solve the factorial, as the number of combinations are astronomical.
C.
Re: An inventory of coins contains 100 different coins.
[#permalink]
23 Aug 2018, 07:42
23 Aug 2018, 07:42
3
Expert Reply
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.
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.
