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
we will pick new questions that match your level based on your Timer History
Track Your Progress
every week, we’ll send you an estimated GMAT score based on your performance
Practice Pays
we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:
In Episode 4 of our GMAT Ninja CR series, we tackle the most intimidating CR question type: Boldface & "Legalese" questions. If you've ever stared at an answer choice that reads, "The first is a consideration introduced to counter a position that...
Most GMAT test-takers are intimidated by the hardest GMAT Verbal questions. In this session, Target Test Prep GMAT instructor Erika Tyler-John, a 100th percentile GMAT scorer, will show you how top scorers break down challenging Verbal questions..
Register for the GMAT Club Virtual MBA Spotlight Fair – the world’s premier event for serious MBA candidates. This is your chance to hear directly from Admissions Directors at nearly every Top 30 MBA program..
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.
Yes but why n-1 ! And not n! Can you give some more color so I can understand
Posted from my mobile device
Show more
The number of arrangements of n distinct objects in a row is given by \(n!\). The number of arrangements of n distinct objects in a circle is given by \((n-1)!\).
From Gmat Club Math Book (combinatorics chapter): "The difference between placement in a row and that in a circle is following: if we shift all object by one position, we will get different arrangement in a row but the same relative arrangement in a circle. So, for the number of circular arrangements of n objects we have:
\(R = \frac{n!}{n} = (n-1)!\)"
\((n-1)!=(5-1)!=24\)
Check Combinatorics chapter of Math Book for more (link in my signature).
One way to think about it, and these problems in general, is to start by counting the possibilities 'naively'. It seems logical that there should be 5! ways to arrange 5 people around a round table, so start with 5!. Then, account for any special circumstances by figuring out whether you actually counted any of the possibilities more than once. In this case, you actually counted each separate possibility five times by using 5!. For instance, you counted these five arrangements as being different, but they're actually the same (since they're just rotations around the table):
(A B C D E) (B C D E A) (C D E A B) (D E A B C) (E A B C D)
In order to correct for the overcounting, you'll divide by 5. 5!/5 = 4!, or 24.
This works for a wide range of counting problems. Suppose you wanted to know how many ways a class of eight people could be split into two groups of four. Naively, there are 8*7*6*5 ways to select the first group of four (after which the second group is determined). But you've overcounted by doing that, since you actually counted these groups as being different:
A B C D B C D A B A C D ... etc.
That is, you counted each different group 4! times. So, the actual answer is (8*7*6*5)/4!, which is equivalent to what you'd get from the combinatorics formula.
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.
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.