Is x > k?
(1) 2^x "¢ 2^k = 4
(2) 9^x "¢ 3^k = 81
A. Statement (1) ALONE is sufficient, but statement (2) alone is not sufficient.
B. Statement (2) ALONE is sufficient, but statement (1) alone is not sufficient.
C. BOTH statements TOGETHER are sufficient, but NEITHER statement ALONE is
sufficient.
D. EACH statement ALONE is sufficient.
E. Statements (1) and (2) TOGETHER are NOT sufficient.
Is x > k?
- Stuart@KaplanGMAT
- GMAT Instructor
- Posts: 3225
- Joined: Tue Jan 08, 2008 2:40 pm
- Location: Toronto
- Thanked: 1710 times
- Followed by:614 members
- GMAT Score:800
Step 1: Analyze the ProblemNijeesh wrote:Is x > k?
(1) 2^x "¢ 2^k = 4
(2) 9^x "¢ 3^k = 81
We see "is", we think "yes/no question: if I can answer with a definite yes or definite no, sufficient; if I answer with a maybe or sometimes or not sure, insufficient".
What do I know? Absolutely nothing! We have 2 variables and 0 equations, so 2 equations would be nice.
Step 2: Evaluate the Statements
(1) 2^x * 2^k = 4
Using the rules of exponents, we now know that:
2^(x+k) = 2^2
so:
x + k = 2
No clue which one is bigger, so insufficient. Eliminate A and D.
(2) 9^x * 3^k = 81
By the same process as above, we know that:
(3^2)^x * 3^k = 3^4
3^2x * 3^k = 3^4
3^(2x + k) = 3^4
2x + k = 4
Again, no clue which one is bigger, so insufficient. Eliminate B.
Together:
2 equations, 2 unknowns, we can solve for x and k: sufficient. Choose C.
* * *
This question is a great illustration of the power of the "number of equations for number of unknowns" rule; the better you understand and apply that rule, the less math you'll have to do.
For example, if on this question we quickly realized that each statement would give us one distinct linear equation, and that each equation contained our two variables (and no others), we could have gone directly to "C" without actually solving each statement.
Stuart Kovinsky | Kaplan GMAT Faculty | Toronto
Kaplan Exclusive: The Official Test Day Experience | Ready to Take a Free Practice Test? | Kaplan/Beat the GMAT Member Discount
BTG100 for $100 off a full course
-
- Master | Next Rank: 500 Posts
- Posts: 182
- Joined: Mon Apr 20, 2009 7:09 pm
- Thanked: 1 times
- Followed by:1 members
I got to C, but used a different technique; testing numbers.
Is X>K? = Y/N question
(1) 2^x.2^k = 4
Possible value combinations for x & k that total to four include:
x = 1, k = 1. Here x = k
x = 0, k = 2. Here x < k
x = 2, k = 0 . Here x > k
As there are multiple possibilities for X>K, we can eliminate answers A and D.
(2) 9^x.3^k = 81
Possible value combinations for x & k that total to 81 include:
x = 2, k = 0. Here x > k
x = 0, k = 4. Here x < k
x = 1, k = 2 . Here x < k
Once again there are multiple possibilities for X>K, so we can eliminate B. Must now choose between C and E.
For it to be C, there must be 1 X vs K combination that is common across both (1) and (2). We can see that there is, the only combination common across both (1) and (2) is x= 2, k=0, which is sufficient as we can now see that x > k.
Therefore answer = C
That took me ~2mins to do. Not sure whether this or the other approach is quicker. What level difficultly would you say this question is?
Thanks
Is X>K? = Y/N question
(1) 2^x.2^k = 4
Possible value combinations for x & k that total to four include:
x = 1, k = 1. Here x = k
x = 0, k = 2. Here x < k
x = 2, k = 0 . Here x > k
As there are multiple possibilities for X>K, we can eliminate answers A and D.
(2) 9^x.3^k = 81
Possible value combinations for x & k that total to 81 include:
x = 2, k = 0. Here x > k
x = 0, k = 4. Here x < k
x = 1, k = 2 . Here x < k
Once again there are multiple possibilities for X>K, so we can eliminate B. Must now choose between C and E.
For it to be C, there must be 1 X vs K combination that is common across both (1) and (2). We can see that there is, the only combination common across both (1) and (2) is x= 2, k=0, which is sufficient as we can now see that x > k.
Therefore answer = C
That took me ~2mins to do. Not sure whether this or the other approach is quicker. What level difficultly would you say this question is?
Thanks
-
- Legendary Member
- Posts: 1337
- Joined: Sat Dec 27, 2008 6:29 pm
- Thanked: 127 times
- Followed by:10 members
@tgou008, way to go BUT I think Stuart has hastened himself
st(1) 2^x "¢ 2^k = 4 --> 2^x "¢ 2^k = |2|^2 AND x+k=2 isn't a unique solution, Not Sufficient
st(2) 9^x "¢ 3^k = 81 --> again |3|^2x "¢ 3^k = 3^4, so obviously 2x+k=4 isn't a unique solution here, Not Sufficient
Only after combining st(1&2) we can assume that x and k have the unique linear relationship, hence x+k=2 And 2x+k=4, x=2 and k=0, choose C
st(1) 2^x "¢ 2^k = 4 --> 2^x "¢ 2^k = |2|^2 AND x+k=2 isn't a unique solution, Not Sufficient
st(2) 9^x "¢ 3^k = 81 --> again |3|^2x "¢ 3^k = 3^4, so obviously 2x+k=4 isn't a unique solution here, Not Sufficient
Only after combining st(1&2) we can assume that x and k have the unique linear relationship, hence x+k=2 And 2x+k=4, x=2 and k=0, choose C
Nijeesh wrote:Is x > k?
(1) 2^x "¢ 2^k = 4
(2) 9^x "¢ 3^k = 81
A. Statement (1) ALONE is sufficient, but statement (2) alone is not sufficient.
B. Statement (2) ALONE is sufficient, but statement (1) alone is not sufficient.
C. BOTH statements TOGETHER are sufficient, but NEITHER statement ALONE is
sufficient.
D. EACH statement ALONE is sufficient.
E. Statements (1) and (2) TOGETHER are NOT sufficient.
My knowledge frontiers came to evolve the GMATPill's methods - the credited study means to boost the Verbal competence. I really like their videos, especially for RC, CR and SC. You do check their study methods at https://www.gmatpill.com
-
- Master | Next Rank: 500 Posts
- Posts: 118
- Joined: Wed Mar 16, 2011 12:51 am
- Location: New Delhi, India
- Thanked: 12 times
- Followed by:1 members
Hi tgou008,tgou008 wrote:I got to C, but used a different technique; testing numbers.
Is X>K? = Y/N question
(1) 2^x.2^k = 4
Possible value combinations for x & k that total to four include:
x = 1, k = 1. Here x = k
x = 0, k = 2. Here x < k
x = 2, k = 0 . Here x > k
As there are multiple possibilities for X>K, we can eliminate answers A and D.
(2) 9^x.3^k = 81
Possible value combinations for x & k that total to 81 include:
x = 2, k = 0. Here x > k
x = 0, k = 4. Here x < k
x = 1, k = 2 . Here x < k
Once again there are multiple possibilities for X>K, so we can eliminate B. Must now choose between C and E.
For it to be C, there must be 1 X vs K combination that is common across both (1) and (2). We can see that there is, the only combination common across both (1) and (2) is x= 2, k=0, which is sufficient as we can now see that x > k.
Therefore answer = C
That took me ~2mins to do. Not sure whether this or the other approach is quicker. What level difficultly would you say this question is?
Thanks
Its good that you have considered all the possible integers as solution for x & k. However, as it is not specified in the question whether x & k are integers or not, it would be worthwhile considering values of x & k in fractions. Although, going to that detail is not required in this question. However, it would really help in GMAT if we do not just consider integers as solutions.
Thanks!!
-
- Master | Next Rank: 500 Posts
- Posts: 118
- Joined: Wed Mar 16, 2011 12:51 am
- Location: New Delhi, India
- Thanked: 12 times
- Followed by:1 members
Hey Night reader,Night reader wrote:@tgou008, way to go BUT I think Stuart has hastened himself
st(1) 2^x "¢ 2^k = 4 --> 2^x "¢ 2^k = |2|^2 AND x+k=2 isn't a unique solution, Not Sufficient
st(2) 9^x "¢ 3^k = 81 --> again |3|^2x "¢ 3^k = 3^4, so obviously 2x+k=4 isn't a unique solution here, Not Sufficient
Only after combining st(1&2) we can assume that x and k have the unique linear relationship, hence x+k=2 And 2x+k=4, x=2 and k=0, choose C
Nijeesh wrote:Is x > k?
(1) 2^x "¢ 2^k = 4
(2) 9^x "¢ 3^k = 81
A. Statement (1) ALONE is sufficient, but statement (2) alone is not sufficient.
B. Statement (2) ALONE is sufficient, but statement (1) alone is not sufficient.
C. BOTH statements TOGETHER are sufficient, but NEITHER statement ALONE is
sufficient.
D. EACH statement ALONE is sufficient.
E. Statements (1) and (2) TOGETHER are NOT sufficient.
Your post definitely helps me in considering the negative square roots for a number (like 2 & -2 for 4). Although, in this question, it was not required as its the power which we are equating to get the equations. Nonetheless, its good to accustom one's mind to consider both positive & negative roots.
Thanks!!
-
- Newbie | Next Rank: 10 Posts
- Posts: 2
- Joined: Fri Nov 27, 2009 11:21 pm
Just wondering why we cant assume negative values for x and k?tgou008 wrote:I got to C, but used a different technique; testing numbers.
Is X>K? = Y/N question
(1) 2^x.2^k = 4
Possible value combinations for x & k that total to four include:
x = 1, k = 1. Here x = k
x = 0, k = 2. Here x < k
x = 2, k = 0 . Here x > k
As there are multiple possibilities for X>K, we can eliminate answers A and D.
(2) 9^x.3^k = 81
Possible value combinations for x & k that total to 81 include:
x = 2, k = 0. Here x > k
x = 0, k = 4. Here x < k
x = 1, k = 2 . Here x < k
Once again there are multiple possibilities for X>K, so we can eliminate B. Must now choose between C and E.
For it to be C, there must be 1 X vs K combination that is common across both (1) and (2). We can see that there is, the only combination common across both (1) and (2) is x= 2, k=0, which is sufficient as we can now see that x > k.
Therefore answer = C
That took me ~2mins to do. Not sure whether this or the other approach is quicker. What level difficultly would you say this question is?
Thanks
x=2+n and k=0-n; will satisfy x+k=2 for all integers.
so please let me know why we are choosing only values equal or greater than 0.
Am i missing something here?
Thanks in advance.
Regards
Piyush
-
- Junior | Next Rank: 30 Posts
- Posts: 14
- Joined: Sun May 15, 2011 6:43 pm
- cans
- Legendary Member
- Posts: 1309
- Joined: Mon Apr 04, 2011 5:34 am
- Location: India
- Thanked: 310 times
- Followed by:123 members
- GMAT Score:750
a)2^(x+k) = 2^2Is x > k?
(1) 2^x "¢ 2^k = 4
(2) 9^x "¢ 3^k = 81
x+k=2
insufficient.
b)3^(2x+k) = 3^4
2x+k=4
Insufficient
both a&b) two equations, 2 variables. x=2 and k=0
Sufficient
IMO C
If my post helped you- let me know by pushing the thanks button
Contact me about long distance tutoring!
[email protected]
Cans!!
Contact me about long distance tutoring!
[email protected]
Cans!!
- aftableo2006
- Senior | Next Rank: 100 Posts
- Posts: 99
- Joined: Sat Oct 16, 2010 1:55 pm
- Thanked: 1 times
- Deependra1
- Senior | Next Rank: 100 Posts
- Posts: 53
- Joined: Sun Apr 10, 2011 12:15 pm
- Thanked: 1 times