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.
Nov 2007:30 AM PST
-08:30 AM PST
Learn what truly sets the UC Riverside MBA apart and how it helps in your professional growth
Nov 2001:30 PM EST
-02:30 PM IST
Learn how Kamakshi achieved a GMAT 675 with an impressive 96th %ile in Data Insights. Discover the unique methods and exam strategies that helped her excel in DI along with other sections for a balanced and high score.
Nov 2206:30 AM PST
-08:30 AM PST
Let’s dive deep into advanced CR to ace GMAT Focus! Join this webinar to unlock the secrets to conquering Boldface and Paradox questions with expert insights and strategies. Elevate your skills and boost your GMAT Verbal Score now!
Nov 2211:00 AM IST
-01:00 PM IST
Do RC/MSR passages scare you? e-GMAT is conducting a masterclass to help you learn – Learn effective reading strategies Tackle difficult RC & MSR with confidence Excel in timed test environment- Nov 23
11:00 AM IST
-01:00 PM IST
Attend this free GMAT Algebra Webinar and learn how to master the most challenging Inequalities and Absolute Value problems with ease. 
Nov 2407:00 PM PST
-08:00 PM PST
Full-length FE mock with insightful analytics, weakness diagnosis, and video explanations!
Nov 2510:00 AM EST
-11:00 AM EST
Prefer video-based learning? The Target Test Prep OnDemand course is a one-of-a-kind video masterclass featuring 400 hours of lecture-style teaching by Scott Woodbury-Stewart, founder of Target Test Prep and one of the most accomplished GMAT instructors.
10 Aug 2016, 09:50
Kudos
Bookmarks
N
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
(N/A)
Question Stats:
0% (00:00) correct
0%
(00:00)
wrong
based on 0
sessions
History
Date
Time
Result
Not Attempted Yet
Sixteen jobs are vacant; how many different batches of men can be chosen out of twenty candidates ? How often may any particular candidate be selected ?
Answer is 20C16 and
For second Answer is 19C15, How??
Can anyone, please explain how to solve this question.
Thanks in advance.
Answer is 20C16 and
For second Answer is 19C15, How??
Can anyone, please explain how to solve this question.
Thanks in advance.
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 Problem Solving (PS) 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!
10 Aug 2016, 17:53
Kudos
Bookmarks
Hi Piyushgmatt,
What is the source of this question? If it's a GMAT question, then it should include 5 answer choices. In many cases, the answer choices provide a clue as to how you might go about solving the prompt. Without having those answers though, we're forced to approach this prompt arithmetically (which is sometimes not the fastest way to get to the correct answer). It should also be posted in the Quant Forums.
The prompt doesn't specify whether the 16 jobs are different jobs or the same job, but the 'intent' of the question is that the sixteen men are interchangeable (any of them can do any job and there's nothing differentiating one job from any of the others). In that way, we have a Combination question, so we can use the Combination Formula:
N!/K!(N-K)! where N is the total number of people and K is the size of the sub-group. We're choosing 16 men from a group of 20...
20!/16!(4!) = (20)(19)(18)(17)/(4)(3)(2)(1)
The second part of the question asks how many times any individual person could be selected under these conditions. If we "lock in" one of the spots for "Person X", then there are 15 other spots remaining for the other 19 men. The same Combination Formula is used, but now we're using 19 and 15 for N and K...
19!/15!(4!)
GMAT assassins aren't born, they're made,
Rich
What is the source of this question? If it's a GMAT question, then it should include 5 answer choices. In many cases, the answer choices provide a clue as to how you might go about solving the prompt. Without having those answers though, we're forced to approach this prompt arithmetically (which is sometimes not the fastest way to get to the correct answer). It should also be posted in the Quant Forums.
The prompt doesn't specify whether the 16 jobs are different jobs or the same job, but the 'intent' of the question is that the sixteen men are interchangeable (any of them can do any job and there's nothing differentiating one job from any of the others). In that way, we have a Combination question, so we can use the Combination Formula:
N!/K!(N-K)! where N is the total number of people and K is the size of the sub-group. We're choosing 16 men from a group of 20...
20!/16!(4!) = (20)(19)(18)(17)/(4)(3)(2)(1)
The second part of the question asks how many times any individual person could be selected under these conditions. If we "lock in" one of the spots for "Person X", then there are 15 other spots remaining for the other 19 men. The same Combination Formula is used, but now we're using 19 and 15 for N and K...
19!/15!(4!)
GMAT assassins aren't born, they're made,
Rich
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 Problem Solving (PS) 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!
Moderator:
