Events & Promotions
|
|
GMAT 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 0710:00 AM PDT
-11:00 AM PDT
A complete walkthrough of GMAT Club’s free 12-week GMAT study plan: what you study each week, how progress and goals are tracked, how the error log works, and how your practice unlocks paid tools at no cost.
Sep 0201:00 PM EDT
-11:59 PM EDT
Take 30% off all study plans with code COURSEWORK - Expires on Monday 9/7
Sep 0410:00 AM EDT
-11:59 PM EDT
We’ve worked incredibly hard to build TTP into the best test prep experience possible, and it would mean a lot to us to win Newsweek’s 2026 Readers’ Choice Award for Best Test Prep. If TTP has helped you, we’d be incredibly grateful for your vote.- Sep 07
12:01 AM PDT
-11:59 PM PDT
On the 7th, GMAT Club Tests will be Free! Including all the Quizzes, Questions, and Tests. 12 AM - 11:59 PM PDT - Sep 09
07:00 AM PDT
-10:00 AM PDT
Meet AdComs and explore top Master’s programs - MiM, MiF, MSc, MSBA and more. - Application Fee Waivers - Free 1-Week of GMAT Club Tests: - Master's Application Toolkit - Grand Prize Giveaway - Sep 09
10:00 AM PDT
-11:00 AM PDT
Three MBA applications. Three rejections. No interview invites. A year later, Aman was admitted to Cambridge Judge, SMU, and IMD. In this episode of MBA Admit Stories, Aman shares how he rebuilt his MBA application... 
Sep 1507:00 PM EDT
-09:00 PM EST
Elite scores are possible when you enroll in a powerful GMAT course, taught live online + 6 months access to TTP OnDemand video courses included! Class starts Tues/Thurs Sept. 15, 2026 - Nov. 15, 2027, 7:00pm-9:00pm EST
Sep 2108:00 PM EDT
-10:00 PM EDT
Boost your GMAT score in less than one month in a live online class + 6 months access to TTP OnDemand video courses included! Class starts Mon, Tues, Wed, Thur, Fri Sept. 21, 2026 - Oct. 9, 2027, 7:00pm-10:00pm EST
15 Dec 2022, 09:59
Kudos
Bookmarks
Hi all, would be extremely grateful if there's a Math Expert who might be able to answer this query (perhaps Bunuel as I know you posted the two following examples that I will provide)
My question surrounds the following: suppose that you've already determined whether the question is looking for permutations or combinations as the correct answer. There now appear two contradictory cases on factorial adjustments, attached below:
Case 1: In how many ways can one divide 12 different chocolate bars into four stacks of 3 bars each?
Solution: Dividing equally means forming 4 groups of 3. We don't care about order within each stack. Ordering the 12 bars gives 12! arrangements, and then answer to Q might first look like \(\frac{12!}{3!\times 3!\times 3!\times 3!}\). BUT the stacks are not distinct. When the question says that you need to make n groups/bundles/teams that are not distinct, you need to divide by (n!). If the groups/bundles/teams are distinct then you do not divide by (n!).
Case 2: How many different 6-digit positive integers are there, where 3 of the digits are each one of the digits 5 or 7, and the other 3 digits are each of one of the digits 1, 4, 6, or 8 ?
Solution: The 3 digits coming from \({5,7}\) can be selected and arranged in \(2\times 2\times 2\) ways, and similarly the 3 digits from \({1,4,6,8}\) can be selected and arranged in \(4\times 4\times 4\) ways. Now, we need to mix up these 2 sets of 3 digits by applying a factorial adjustment. The total number of ways is then = \(2^3 \times 4^3 \times \frac{6!}{3!3!}\), giving \(10,240\) total ways.
Now, as we can see from the bolded section of the Case 1 solution, the adjustment following a string of multiplications is either to divide (when ordering does not matter), or leave things untouched (if ordering does matter). Intuitively, this is because the string of multiplications would represent arranging, right? And then if you don't care about arrangement (i.e. you've determined that the question is looking for the number of combinations), you would divide by the relevant factorial adjustment. BUT in Case 2, you're multiplying a string of multiplications by a factorial adjustment - whilst the bolded advice from Case 1's solution tells us you only either divide, or leave the string of multiplications untouched (and therefore never a case where you have to multiply the string of multiplications by a further factorial adjustment).
Put differently, suppose I've determined that the question is asking me to look for permutations. I'm then quite confused over deciding when I need to multiply by a factorial correction, and when I should leave things untouched because my string of multiplications already incorporates the factorial adjustments. It appears, at first glance, that Case 1 and Case 2 are quite contradictory to me and I'm quite curious to see how this can be reconciled!
Thank you so much!
- FictionFire
My question surrounds the following: suppose that you've already determined whether the question is looking for permutations or combinations as the correct answer. There now appear two contradictory cases on factorial adjustments, attached below:
Case 1: In how many ways can one divide 12 different chocolate bars into four stacks of 3 bars each?
Solution: Dividing equally means forming 4 groups of 3. We don't care about order within each stack. Ordering the 12 bars gives 12! arrangements, and then answer to Q might first look like \(\frac{12!}{3!\times 3!\times 3!\times 3!}\). BUT the stacks are not distinct. When the question says that you need to make n groups/bundles/teams that are not distinct, you need to divide by (n!). If the groups/bundles/teams are distinct then you do not divide by (n!).
Case 2: How many different 6-digit positive integers are there, where 3 of the digits are each one of the digits 5 or 7, and the other 3 digits are each of one of the digits 1, 4, 6, or 8 ?
Solution: The 3 digits coming from \({5,7}\) can be selected and arranged in \(2\times 2\times 2\) ways, and similarly the 3 digits from \({1,4,6,8}\) can be selected and arranged in \(4\times 4\times 4\) ways. Now, we need to mix up these 2 sets of 3 digits by applying a factorial adjustment. The total number of ways is then = \(2^3 \times 4^3 \times \frac{6!}{3!3!}\), giving \(10,240\) total ways.
Now, as we can see from the bolded section of the Case 1 solution, the adjustment following a string of multiplications is either to divide (when ordering does not matter), or leave things untouched (if ordering does matter). Intuitively, this is because the string of multiplications would represent arranging, right? And then if you don't care about arrangement (i.e. you've determined that the question is looking for the number of combinations), you would divide by the relevant factorial adjustment. BUT in Case 2, you're multiplying a string of multiplications by a factorial adjustment - whilst the bolded advice from Case 1's solution tells us you only either divide, or leave the string of multiplications untouched (and therefore never a case where you have to multiply the string of multiplications by a further factorial adjustment).
Put differently, suppose I've determined that the question is asking me to look for permutations. I'm then quite confused over deciding when I need to multiply by a factorial correction, and when I should leave things untouched because my string of multiplications already incorporates the factorial adjustments. It appears, at first glance, that Case 1 and Case 2 are quite contradictory to me and I'm quite curious to see how this can be reconciled!
Thank you so much!
- FictionFire
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Quantitative Questions Forum
Still interested in this question? Check out the "Best Topics" block below for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
