If Jay has 99 problems, in how many ways can he select k of them to ra

Hi Chetan

Could you please elaborate on the first statement. How did you determine its insufficiency?

Hi when you are looking for combinations..
Choosing k out of say 10 will be same as finding 10-k out of 10 so 10C4 = 10C(10-4)..
Why 10C4=10!/(4!*(10-4)!)=10!/4!6!
And 10C6 = 10!/6!(10-6)!=10!/6!4!
Both same ,

So k can be 4 or 6 as both will give same value

Let me solve a "different" problem. In the end, I am sure you will understand the solution to the original problem throughly!



\(? = C\left( {7,k} \right)\,\,\,\,\,\, \Leftrightarrow \,\,\,\,\,\,\boxed{\,? = k\,}\)


\(\left( 1 \right)\,\,\,C\left( {7,k + 1} \right) = 35\,\,\,\,\,\,\mathop \Rightarrow \limits^{\left( * \right)} \,\,\,\,\,k + 1 = 4\,\,\,{\text{or}}\,\,\,k + 1 = 3\,\,\,\,\,\, \Rightarrow \,\,\,\,\,\,k = 3\,\,\,\,{\text{or}}\,\,\,\,k = 2\,\,\,\,\,\, \Rightarrow \,\,\,\,\,\,{\text{INSUFF}}.\)

\(\left( * \right)\,\,C\left( {7,4} \right) = C\left( {7,7 - 4} \right) = 35\,\,\,\,\,\,\)


\(\left( 2 \right)\,\,\,C\left( {7,k - 1} \right) = 21\,\,\,\,\,\,\mathop \Rightarrow \limits^{\left( {**} \right)} \,\,\,\,\,k - 1 = 2\,\,\,{\text{or}}\,\,\,k - 1 = 5\,\,\,\,\,\, \Rightarrow \,\,\,\,\,\,k = 3\,\,\,\,{\text{or}}\,\,\,\,k = 6\,\,\,\,\,\, \Rightarrow \,\,\,\,\,\,{\text{INSUFF}}{\text{.}}\)

\(\left( {**} \right)\,\,C\left( {7,2} \right) = C\left( {7,7 - 2} \right) = 21\)


\(\left( {1 + 2} \right)\,\,\,\left\{ \matrix{\\
\,\left( 1 \right)\,\,\, \Rightarrow \,\,\,k = 3\,\,\,\,{\rm{or}}\,\,\,\,k = 2 \hfill \cr \\
\,\left( 2 \right)\,\,\, \Rightarrow \,\,\,k = 3\,\,\,\,{\rm{or}}\,\,\,\,k = 6 \hfill \cr} \right.\,\,\,\,\,\,\,\, \Rightarrow \,\,\,\,k = 3\,\,\,\,\,\, \Rightarrow \,\,\,\,\,\,{\rm{SUFF}}{\rm{.}}\,\,\,\,\)


This solution follows the notations and rationale taught in the GMATH method.

Regards,
Fabio.

Rule:
nCr = nC(n-r)

Examples:
5C2 = 5C(5-2) = 5C3.
10C3 = 10C(10-3) = 10C7.
99C5 = 99C(99-5) = 99C94.



Statement 2: Jay can select k-1 of his problems in 4851 different ways.
Since 4851 is relatively small, test small values for k-1.
Case 1: k-1 = 2
From 99 problems, the number of ways to choose 2 = 99C2 = (99*98)/(2*1) = 4851.
This works.
Thus, it's possible that k-1=2.
Since 99C2 = 99C97, it's also possible that k-1=97.
k-1=2 implies that k=3.
k-1=97 implies that k=98.
Thus, Statement 1 offers two options:
k=3 or k=98.
INSUFFICIENT.

Rule:
For every DS problem, there must be at least ONE CASE that satisfies both statements.

Statement 1: Jay can select k+1 of his problems in 3764376 different ways.
Only two cases satisfy Statement 2: k=3 and k=98.
At least one of these two cases must also satisfy Statement 1.
Test k=98.

Case 2: k=98, implying that k+1=99
From 99 problems, the number of ways to choose 99 = 99C99 = 1.
k+1=99 does not satisfy the condition that the number of ways to choose k+1 problems is 3764376.
Thus, Case 2 is not viable.

Implication:
Since there must be at least one case that satisfies both statements, it MUST be possible in Statement 1 that k=3, with the result that k+1=4.
Since it's possible in Statement 1 that k+1=4, we know that 99C4 = 3764376.
Since 99C4 = 99C95, it must also be possible in Statement 1 that k+1=95, with the result that k=94.
Thus, Statement 1 offers two options:
k=3 or k=94.
INSUFFICIENT.

Statements combined:
Only the blue option above satisfies both statements, implying that k=3.
SUFFICIENT.

still waiting for that one clear explaination:

I got D. both are suff.

from st 1 > 99 !/ (99-k+1)!* k+1! = 3764376

from st 2> 99!/(99-(k-1)!*K-1!= 4851.

using both the stmts we can find a unique value for K? and we should have D as the answer.
would appreciate if someone could help out here.

As shown in my earlier post:
Statement 1 is satisfied by two values: k=3 and k=94.
Statement 2 is also satisfied by two values: k=3 and k=98.
Thus, each statement on its own is INSUFFICIENT.
Only k=3 satisfies BOTH statements.
Thus, the two statements COMBINED are sufficient to determine that k=3.

[quote="chetan2u"]
But how do we know for sure that one of the two k values in each statement will overlap? Can it not be the case that both statements give four different values of k?

Please help!

There is one exact value of k as per the main statement.

Statement I will give us 2 values, one this exact value of k and some other value, total-exact value.
Statement II would also do the same thing. One exact value and some other value.
The common in two statement will be this EXACT value we are looking for.
You cannot have k having different values in the different statements in actual GMAT.

It is similar to:
What is x?
1) some quadratic equation say x^2-7x+12=0
2) some quadratic equation say x^2-x-6=0

Now each of the statements will give two values of x, and x has to be one of them.
So the common value will give you the answer.

But say one statement was x^2-6x+9=0....(x-3)^2=0. Both the values of x are 3. So sufficient on its own.
If the statement II in this case too gives you two values of x. One would surely be 3. Otherwise the two statements do not match as they do not give same value of x.
Few unofficial questions do have different values in each statement, a situation that is wrong as per actual GMAT.

Hi chetan, how would you realistically break up 4851 to  99*49?

­

unicornilove
Since we are talking of nC(k-1) being equal to 4851, it has to be a multiple of n and n is 99 here.
Also, the divisibility rule of 9 and 11 will tell you that 4851 is a multiple of both 9 and 11.
9: 4+8+5+1 is a multiple of 9.
11: (4+5)-(8+1) is a multiple of 11

Now once we know 4851 will be a multiple of 99, we can home on to the second factor.
4851=99*ab, where b has to be 9, that is 4851*a9
4851 is close to 5000 or 100*50, so 99*49 is the most likely answer between possible 99*39, 99*49 or 99*59.

Generally number properties should get you closer to the answer faster.

 

­If we take the statement 1, 99C(k+1)=\(99!/(k+1)!*(98-k)!\)=3764376....(i) Insufficient.
From the statement 2, 99C(k-1)=\(99!/(k-1)!*(100-k)!\)=4851....(ii) Insufficient.

Divide (i) by (ii), \((k-1)!*(100-k)!/(k+1)!*(98-k)!\)=\(3764376/4851\)=776
or, \((100-k)*(99-k)/k*(k+1)\)=776
or, (100-k)*(99-k)=776*k*(k+1) - we can find the value of k from here. Option (C) is correct.