Author 
Message 
TAGS:

Hide Tags

Intern
Joined: 22 Dec 2009
Posts: 40

How many different 5person teams can be formed from a group [#permalink]
Show Tags
22 Jun 2010, 19:14
1
This post received KUDOS
23
This post was BOOKMARKED
Question Stats:
88% (00:48) correct 12% (01:01) wrong based on 765 sessions
HideShow timer Statistics
How many different 5person teams can be formed from a group of x individuals? (1) If there had been x + 2 individuals in the group, exactly 126 different 5person teams could have been formed. (2) If there had been x + 1 individuals in the group, exactly 56 different 3person teams could have been formed. The answer is D and I know how to figure out now but is there any trick to know each question is sufficient without actual compute? cuz its time consuming until I found out e.g. 1) is 9!/5!4! thanks in advance
Official Answer and Stats are available only to registered users. Register/ Login.



Manager
Joined: 04 May 2010
Posts: 86
WE 1: 2 yrs  Oilfield Service

Re: Manhattan Q/DS [#permalink]
Show Tags
22 Jun 2010, 21:31
12
This post received KUDOS
1
This post was BOOKMARKED
We need a unique value.
1. (x+2) C 5 = 126. There is only one possible value for x+2 that would yield a value of 126. Don't bother trying to find out what it is. Remember, the only nonunique solution will be for the "r" in nCr eg. (8C3 = 8C5) but for n not equal to m, nCr can never be equal to mCr.
2. (x+1) C 3 = 56 Again, you should be able to see that there can be only one value of x+1 that would yield a value of 56. Why bother finding out what the value is? As long as we have an equation in one variable, we can find a value.



Intern
Joined: 22 Dec 2009
Posts: 40

Re: Manhattan Q/DS [#permalink]
Show Tags
22 Jun 2010, 22:27
HI AbhayPrasanna.. Thanks for the reply...
I understood the first half but I dont follow your explanation of 'the only nonunique solution will be for the "r" in nCr eg. (8C3 = 8C5) but for n not equal to m, nCr can never be equal to mCr' ...
How do you know (x+2) C 5 = 126 is computable



Manager
Joined: 28 Feb 2010
Posts: 154
WE 1: 3 (Mining Operations)

Re: Manhattan Q/DS [#permalink]
Show Tags
24 Jun 2010, 02:50
I agree with GmatJP...but I think we need to assume that whatever is given in the options is assumed to be true.So the x has to have an integral value. But my concern is..what if the polynomial equation so formed of degree 5 have multiple solutions. In that case, the options fails to answer the situation. @Abhayprasanna : The logic is correct and infact I also choose D going by the same logic.
_________________
Regards, Invincible... "The way to succeed is to double your error rate." "Most people who succeed in the face of seemingly impossible conditions are people who simply don't know how to quit."



Math Expert
Joined: 02 Sep 2009
Posts: 44388

Re: Manhattan Q/DS [#permalink]
Show Tags
25 Jun 2010, 05:41
23
This post received KUDOS
Expert's post
15
This post was BOOKMARKED
gmatJP wrote: HI AbhayPrasanna.. Thanks for the reply...
I understood the first half but I dont follow your explanation of 'the only nonunique solution will be for the "r" in nCr eg. (8C3 = 8C5) but for n not equal to m, nCr can never be equal to mCr' ...
How do you know (x+2) C 5 = 126 is computable praveenism wrote: I agree with GmatJP...but I think we need to assume that whatever is given in the options is assumed to be true.So the x has to have an integral value. But my concern is..what if the polynomial equation so formed of degree 5 have multiple solutions. In that case, the options fails to answer the situation.
@Abhayprasanna : The logic is correct and infact I also choose D going by the same logic. The point here is the following: Suppose we are told that there are 10 ways to choose \(x\) people out of 5. What is \(x\)? \(C^x_5=10\) > \(\frac{5!}{x!(5x)!}=10\) > \(x!(5x)!=12\) > \(x=3\) or \(x=2\). So we cannot determine single numerical value of \(x\). Note that in some cases we'll be able to find \(x\), as there will be only one solution for it, but generally when we are told that there are \(n\) ways to choose \(x\) out of \(m\) there will be (in most cases) two solutions of \(x\) possible. But if we are told that there are 10 ways to choose 2 out of \(x\), then there will be only one value of \(x\) possible > \(C^2_x=10\) > \(\frac{x!}{2!(x2)!}=10\) > \(\frac{x(x1)}{2!}=10\) > \(x(x1)=20\) > \(x=5\). In our original question, statement (1) says that there are 126 ways to choose 5 out of \(x+2\) > there will be only one value possible for \(x+2\), so we can find \(x\). Sufficient. Just to show how it can be done: \(C^5_{(x+2)}=126\) > \((x2)(x1)x(x+1)(x+2)=5!*126=120*126=(8*5*3)*(9*7*2)=5*6*7*8*9\) > \(x=7\). Basically we have that the product of five consecutive integers (\((x2)(x1)x(x+1)(x+2)\)) equal to some number (\(5!*126\)) > only one such sequence is possible, hence even though we have the equation of 5th degree it will have only one positive integer solution. Statement (2) says that there are 56 ways to choose 3 out of \(x+1\) > there will be only one value possible for \(x+1\), so we can find \(x\). Sufficient. \(C^3_{(x+1)}=56\) > \((x1)x(x+1)=3!*56=6*7*8\) > \(x=7\). Again we have that the product of three consecutive integers (\((x1)x(x+1)\)) equal to some number (\(3!*56\)) > only one such sequence is possible, hence even though we have the equation of 3rd degree it will have only one positive integer solution. Hope it helps.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
Collection of Questions: PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Kaplan GMAT Instructor
Joined: 21 Jun 2010
Posts: 71
Location: Toronto

Re: Manhattan Q/DS [#permalink]
Show Tags
25 Jun 2010, 23:29
4
This post received KUDOS
Bunuel supplied an awesome and exhaustive mathematical algebraic explanation. Perhaps it will be of benefit to review the concept verbally as well.
8C5 = 8C3 because everytime we pull a subgroup of 5 objects from the bigger group of 8, we can see that we are also "setting aside" a subgroup of 3. Likewise, everytime we pull out a subgroup of 3, we also set aside a subgrup of 5. So, the number of ways we can pull out 5 object subgroups must be the same as the number of ways we can pull out 3 object subgroups.
But if there are 126 ways to pull 5 objects from a big group "x + 2", then "x+2" must be just one value. If it were not, then it would imply that increasing or decresing the size of the big group doesn't necessarily affect how many ways you can pull out a smaller subgroupsurely an absurd conclusion. Absurd because clearly there are more ways to pull 5 objects out of a set of 100 than out of a set of, say, 10.



Intern
Joined: 03 Dec 2010
Posts: 22

Re: How many different 5person teams can be formed from a group [#permalink]
Show Tags
06 Apr 2012, 08:07
Hello to all,
Can any1 pls explain the calculation in a bit more simplier way. I didn't get how,
3Cx+1 =56 and how, 5Cx+2 = 126 ?
Thnx



Math Expert
Joined: 02 Sep 2009
Posts: 44388

Re: How many different 5person teams can be formed from a group [#permalink]
Show Tags
06 Apr 2012, 08:28



Manager
Joined: 07 Sep 2011
Posts: 62
Location: United States
Concentration: Strategy, International Business
WE: General Management (Real Estate)

Re: How many different 5person teams can be formed from a group [#permalink]
Show Tags
20 Aug 2012, 03:39
Bunuel, Can you please confirm if my understanding is correct? (x+1)!= 3 consecutive numbers (x1) x (x+1) (x+3)!= Basically 7 consecutive numbers i.e. (x3) (x2) (x1) x (x+1) (x+2) (x+3) (x+2)!= 5 consecutive numbers i.e. (x2) (x1) x (x+1) (x+2) Bunuel wrote: priyalr wrote: Hello to all,
Can any1 pls explain the calculation in a bit more simplier way. I didn't get how,
3Cx+1 =56 and how, 5Cx+2 = 126 ?
Thnx # of ways to pick \(k\) objects out of \(n\) distinct objects is \(C^k_n=\frac{n!}{(nk)!*k!}\). # of ways to pick 3 people out of x+1 people is \(C^3_{(x+1)}=\frac{(x+1)!}{(x+13)!*3!}=\frac{(x+1)!}{(x2)!*3!}\). Now, since \((x+1)!=(x2)!*(x1)*x*(x+1)\) then \((x2)!\) get reduced and we'll have: \(\frac{(x1)*x*(x+1)}{3!}\). We are told that this equals to 56: \(\frac{(x1)*x*(x+1)}{3!}=56\) > \((x1)x(x+1)=3!*56=6*7*8\) > \(x=7\). You can apply similar logic to \(C^5_{(x+2)}=126\). Hope it's clear.



Manager
Joined: 05 Mar 2012
Posts: 62

Re: How many different 5person teams can be formed from a group [#permalink]
Show Tags
22 Aug 2012, 14:23
1
This post received KUDOS
manjeet1972 wrote: Bunuel,
Can you please confirm if my understanding is correct?
(x+1)!= 3 consecutive numbers (x1) x (x+1) (x+3)!= Basically 7 consecutive numbers i.e. (x3) (x2) (x1) x (x+1) (x+2) (x+3) (x+2)!= 5 consecutive numbers i.e. (x2) (x1) x (x+1) (x+2)
[/quote] Plug in numbers yourself. let x = 4, so you have (4+1)! = 5! = 5 * 4 * 3 * 2 * 1. But if x = 219739218731927 then you have a lot more terms. Instead, try to compare things logically. Say you have (x+1)! / (x4)! ...now what happens normally for simplifying factorials? If you have 11!/6! then it's 11 * 10 * 9 * 8 * 7. You go down by 1 term until you hit the denominator and remove. Same concept. So now (x+1)! = (x+1) * x * (x1) * (x2) * (x3) * (x4) ...until you reach the end. But since we know the denominator is (x4)! then we only have to go up to (x+1) * x * (x1) * (x2) * (x3) on the numerator. Once you simplify the factorials, you can line them up like how Bunuel did and match it with the expanded form of (5!)(126) which would take a while to flat out compute but you just need to determine if it's solvable.



Manager
Joined: 07 Sep 2011
Posts: 62
Location: United States
Concentration: Strategy, International Business
WE: General Management (Real Estate)

Re: How many different 5person teams can be formed from a group [#permalink]
Show Tags
22 Aug 2012, 22:38
Good explanation. Through practice I will learn. Injuin wrote: manjeet1972 wrote: Bunuel,
Can you please confirm if my understanding is correct?
(x+1)!= 3 consecutive numbers (x1) x (x+1) (x+3)!= Basically 7 consecutive numbers i.e. (x3) (x2) (x1) x (x+1) (x+2) (x+3) (x+2)!= 5 consecutive numbers i.e. (x2) (x1) x (x+1) (x+2)
Plug in numbers yourself. let x = 4, so you have (4+1)! = 5! = 5 * 4 * 3 * 2 * 1. But if x = 219739218731927 then you have a lot more terms. Instead, try to compare things logically. Say you have (x+1)! / (x4)! ...now what happens normally for simplifying factorials? If you have 11!/6! then it's 11 * 10 * 9 * 8 * 7. You go down by 1 term until you hit the denominator and remove. Same concept. So now (x+1)! = (x+1) * x * (x1) * (x2) * (x3) * (x4) ...until you reach the end. But since we know the denominator is (x4)! then we only have to go up to (x+1) * x * (x1) * (x2) * (x3) on the numerator. Once you simplify the factorials, you can line them up like how Bunuel did and match it with the expanded form of (5!)(126) which would take a while to flat out compute but you just need to determine if it's solvable.[/quote]



Math Expert
Joined: 02 Sep 2009
Posts: 44388

Re: How many different 5person teams can be formed from a group [#permalink]
Show Tags
01 Jul 2013, 00:46



Math Revolution GMAT Instructor
Joined: 16 Aug 2015
Posts: 5063
GPA: 3.82

Re: How many different 5person teams can be formed from a group [#permalink]
Show Tags
02 Apr 2017, 08:23
gmatJP wrote: How many different 5person teams can be formed from a group of x individuals?
(1) If there had been x + 2 individuals in the group, exactly 126 different 5person teams could have been formed.
(2) If there had been x + 1 individuals in the group, exactly 56 different 3person teams could have been formed.
The answer is D and I know how to figure out now but is there any trick to know each question is sufficient without actual compute? cuz its time consuming until I found out e.g. 1) is 9!/5!4!
thanks in advance Forget conventional ways of solving math questions. In DS, Variable approach is the easiest and quickest way to find the answer without actually solving the problem. Remember equal number of variables and independent equations ensures a solution. There are 1 variable x and 0 equation are given from the conditions of the original questions, so there is high chance (D) will be our answer. The question asks what the value of \(_xC_2\) is. Condition (1) \(_{x+2}C_5\) = 126. We can determine what the value of x is. Hence, this condition is sufficient. We don't need calculate it. Condition (2) \(_{x+1}C_3\) = 56. We can determine what the value of x is. Hence, this condition is sufficient. We don't need calculate it. Therefore, the correct answer is D. Keep in mind that DS is totally different from PS. DS questions do NOT ask what the exact value is.
_________________
MathRevolution: Finish GMAT Quant Section with 10 minutes to spare The oneandonly World’s First Variable Approach for DS and IVY Approach for PS with ease, speed and accuracy. "Only $79 for 3 month Online Course" "Free Resources30 day online access & Diagnostic Test" "Unlimited Access to over 120 free video lessons  try it yourself"



Intern
Joined: 16 Apr 2008
Posts: 1

How many different 5person teams can be formed from a group [#permalink]
Show Tags
15 Nov 2017, 11:09
I have a conceptual question a student I tutor raised to me the other day. While we all assume that the question is asking for the number of ways a SINGLE 5person team can be formed, the question never actually specifies this. In order words, if there were 11 people to choose from than we could actually make two different 5person teams with one person left over. The number of combos for the 1st team[(11*10*9*8*7)/(5!)] would limit the number of combos for the 2nd team[(6*5*4*3*2)/(5!)]. The number of different 5person teams would then be those summed together. What is wrong with interpreting the question this way????




How many different 5person teams can be formed from a group
[#permalink]
15 Nov 2017, 11:09






