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 0907: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 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.
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!
