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.
Jun 0308:30 AM PDT
-09:30 AM PDT
In Episode 7 of our GMAT Ninja CR series, we are rounding up the oddballs, the misfits, and the format-benders: EXCEPT, Fill-In-The-Blanks, and other unusual Critical Reasoning question types. When you see a question that ends with a literal blank line
May 2910:00 AM IST
-11:00 PM IST
Start your journey with a fully customized action plan and work with a dedicated mentor to achieve a 735+ score.- Jun 04
08:30 AM PDT
-09:30 AM PDT
For most test takers, Data Insights is the most challenging section on the GMAT, with test takers scoring several points lower on average on DI than on Quant or Verbal and completing the section with less time to spare. - Jun 10
06:00 AM PDT
-06:15 PM PDT
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..
26 Dec 2006, 11:36
Kudos
Bookmarks
Hello,
OG 11 -- Question 195 on taking the minimum distance from point x to point y.
The explanation gives answer that counts all the paths one by one.
Any other easier way ? using Permutations ?
If the number of paths were more than what is given in this question stem, then counting them all one by one will not be possible. Permutations will be the only way out.
Any pointers ?
Thanks..
OG 11 -- Question 195 on taking the minimum distance from point x to point y.
The explanation gives answer that counts all the paths one by one.
Any other easier way ? using Permutations ?
If the number of paths were more than what is given in this question stem, then counting them all one by one will not be possible. Permutations will be the only way out.
Any pointers ?
Thanks..
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!
26 Dec 2006, 19:06
Kudos
Bookmarks
Yes , there is .
Rule : Number of permutations of n-thing, taken all at a time, in which ‘p’ are of one type, ‘g’ of them are of second-type, ‘r’ of them are of third-type, and rest are all different is given by :-
n!/p! x q! x r!
Permutation of 5 paths from 3U , 2R paths = 5!/(3! *2!)
Rule : Number of permutations of n-thing, taken all at a time, in which ‘p’ are of one type, ‘g’ of them are of second-type, ‘r’ of them are of third-type, and rest are all different is given by :-
n!/p! x q! x r!
Permutation of 5 paths from 3U , 2R paths = 5!/(3! *2!)
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 above for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
