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 2106:30 AM PDT
-08:30 AM PDT
Not only the typical inference questions but also all other CR questions on the GMAT require the ability to deduce from the given information. Come master how to draw inferences accurately and efficiently with Verbal Expert-Sunita Singhvi. Limited Seats!
Jun 2111: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
Jun 1903:00 AM PDT
-11:00 PM PDT
The Target Test Prep GMAT Flash Sale is LIVE! Get 25% off our game-changing course and save up to $450 today! Use code FLASH25 at checkout. This limited-time deal won’t last long, so grab your discount now!- Jun 19
03:00 AM PDT
-11:00 PM PDT
Get a massive $325 off the TTP OnDemand GMAT masterclass by using the coupon code FLASH25 at checkout. If you prefer learning through engaging video lessons, TTP OnDemand GMAT is exactly what you need. - Jun 20
10:00 AM PDT
-11:00 AM PDT
Class is officially in session! Join Charles Bibilos from GMAT Ninja and GMAC’s own Jaime Malatesta, Senior Psychometrician, as they simplify some of the complexities of GMAT scoring. 
Jun 2211:30 AM EDT
-12:30 PM EDT
Learn how Keshav, a Chartered Accountant, scored an impressive 705 on GMAT in just 30 days with GMATWhiz's expert guidance. In this video, he shares preparation tips and strategies that worked for him, including the mock, time management, and more.
Jun 2308:00 PM PDT
-09:00 PM PDT
Full-length FE mock with insightful analytics, weakness diagnosis, and video explanations!- Jun 30
08:00 AM PDT
-11:59 PM PDT
Join us June 30th for 2 weeks of GMAT questions (just 8 per day) to help with your prep and to compete with your fellow GMAT Clubbers for a chance to win a prize fund of $30,000 for you and your team-mates!
17 Jan 2012, 15:38
Kudos
Bookmarks
B
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
35%
(medium)
Question Stats:
73% (02:13) correct
27%
(02:18)
wrong
based on 427
sessions
History
Date
Time
Result
Not Attempted Yet
A company bought for its 7 offices 2 computers of brand N and 3 computers of brand M. In how many ways could computers be distributed among the offices if each office can have only 1 computer.
A. 196
B. 210
C. 256
D. 292
E. 312
A. 196
B. 210
C. 256
D. 292
E. 312
17 Jan 2012, 17:17
Kudos
Bookmarks
Hi, there. I'm happy to help with this. 
This problem has to do with combinations. Here's the general idea: if you have a set of n elements, and you are going to choose r of them (r < n), then the number of combinations of size r one could choose from this total set of n is:
# of combinations = nCr = (n!)/[(r!)((n-r)!)]
where n! is the factorial symbol, which means the product of every integer from n down to 1. BTW, nCr is read "n choose r."
In this problem, let's consider first the three computers of brand M. How many ways can three computer be distributed to seven offices?
# of combinations = 7C3 = (7!)/[(3!)(4!)] = (7*6*5*4*3*2*1)/[3*2*1)(4*3*2*1)]
= (7*6*5)/(3*2*1) = (7*6*5)/(6) = 7*5 = 35
There are 35 different ways to distribute three computers to 7 offices. (The massive amount of cancelling that occurred there is very much typical of what happens in the nCr formula.)
One we have distributed those three M computers, we have to distribute 2 N computers to the remaining four offices. How many ways can two computer be distributed to four offices?
# of combinations = 4C2 = (4!)/[(2!)(2!)] = (4*3*2*1)/[(2*1)(2*1)] = (4*3)/(2*1) = 12/2 = 6
For each of the 35 configurations of distributing the M computers, we have 6 ways of distributing the N computers to the remaining offices. Thus, the total number of configurations is 35*6 = 210. Answer choice = B
Notice, we would get the same answer if we distributed the N computers first.
Number of ways to distribute 2 N computers to seven offices = 7C2 = (7!)/[(2!)(5!)] = (7*6)/(2*1) = 21
Number of ways to distribute the 3 M computers to the remaining five offices = 5C3 = (5!)/[(3!)(2!)] = (5*4)/(2*1) = 20/2 = 10
Product of ways = 21*10 = 210. Same answer.
Here's a blog article I wrote about this topic, with some practice questions.
https://magoosh.com/gmat/2012/gmat-permu ... binations/
Does this make sense? Please let me know if you any questions on what I've said.
Mike
This problem has to do with combinations. Here's the general idea: if you have a set of n elements, and you are going to choose r of them (r < n), then the number of combinations of size r one could choose from this total set of n is:
# of combinations = nCr = (n!)/[(r!)((n-r)!)]
where n! is the factorial symbol, which means the product of every integer from n down to 1. BTW, nCr is read "n choose r."
In this problem, let's consider first the three computers of brand M. How many ways can three computer be distributed to seven offices?
# of combinations = 7C3 = (7!)/[(3!)(4!)] = (7*6*5*4*3*2*1)/[3*2*1)(4*3*2*1)]
= (7*6*5)/(3*2*1) = (7*6*5)/(6) = 7*5 = 35
There are 35 different ways to distribute three computers to 7 offices. (The massive amount of cancelling that occurred there is very much typical of what happens in the nCr formula.)
One we have distributed those three M computers, we have to distribute 2 N computers to the remaining four offices. How many ways can two computer be distributed to four offices?
# of combinations = 4C2 = (4!)/[(2!)(2!)] = (4*3*2*1)/[(2*1)(2*1)] = (4*3)/(2*1) = 12/2 = 6
For each of the 35 configurations of distributing the M computers, we have 6 ways of distributing the N computers to the remaining offices. Thus, the total number of configurations is 35*6 = 210. Answer choice = B
Notice, we would get the same answer if we distributed the N computers first.
Number of ways to distribute 2 N computers to seven offices = 7C2 = (7!)/[(2!)(5!)] = (7*6)/(2*1) = 21
Number of ways to distribute the 3 M computers to the remaining five offices = 5C3 = (5!)/[(3!)(2!)] = (5*4)/(2*1) = 20/2 = 10
Product of ways = 21*10 = 210. Same answer.
Here's a blog article I wrote about this topic, with some practice questions.
https://magoosh.com/gmat/2012/gmat-permu ... binations/
Does this make sense? Please let me know if you any questions on what I've said.
Mike
18 Jan 2012, 04:15
Kudos
Bookmarks
Halawi
+1 for B.
I solved it in a slightly different way. I would love feedback on the logic.
Again, this is a comb problem. So I though of it as follows.
From the seven offices, there will be 5 'winners' (of PCs) and 2'losers'. The number of ways they could be winners and losers is 7!/(5!2!) = 21
For the five winners, the 5 computers can be distributed in 5!/(2!3!) ways = 10.
If you have trouble seeing this, think of anagrams NNMMM (so 5! ways of ordering them but divide by 2! because 2 Ns are similar and 3! because 3 'M's are similar.)
The number of different combinations is then 21*10 = 210 -> B.
Cheers!
I solved it in a slightly different way. I would love feedback on the logic.
Again, this is a comb problem. So I though of it as follows.
From the seven offices, there will be 5 'winners' (of PCs) and 2'losers'. The number of ways they could be winners and losers is 7!/(5!2!) = 21
For the five winners, the 5 computers can be distributed in 5!/(2!3!) ways = 10.
If you have trouble seeing this, think of anagrams NNMMM (so 5! ways of ordering them but divide by 2! because 2 Ns are similar and 3! because 3 'M's are similar.)
The number of different combinations is then 21*10 = 210 -> B.
Cheers!
Yes, that's correct:
Picking 5 winning offices from 7 - \(C^5_7=21\);
Different assignment of NNMMM to these offices: \(\frac{5!}{2!3!}=10\) (which basically is # of permutations of 5 letters NNMMM out of which 2 N's and 3 M' are identical).
Total: 21*10=210.
Answer: B.
