-
rajesh_ctm
- Master | Next Rank: 500 Posts
- Posts: 135
- Joined: Tue Feb 27, 2007 7:21 pm
- Thanked: 2 times
What is the solution ? Is it "E"
If you can confirm the solution, I can tell the approach.
GMATPrep question
This topic has expert replies
Source: Beat The GMAT — Data Sufficiency |
-
rajesh_ctm
- Master | Next Rank: 500 Posts
- Posts: 135
- Joined: Tue Feb 27, 2007 7:21 pm
- Thanked: 2 times
-
jayhawk2001
- Community Manager
- Posts: 789
- Joined: Sun Jan 28, 2007 3:51 pm
- Location: Silicon valley, California
- Thanked: 30 times
- Followed by:1 members
Plugging in values might be your best bet here.
Have a sorted list in increasing order i.e.
B C D E A F
1 - Insufficient. A = 41 or F = 41 (only 2 possibilities).
If A = 41, yes > 10
If F = 41, the list can be "4 6 7 8 9 41" or "2 6 7 8 11 41"
So insufficient.
2 - Insufficient. List can be same as in 1 i.e. "4 6 7 8 9 41" or
"2 6 7 8 11 41". There are numerous possibilities
Using 1 and 2, we still cannot arrive at a unique value (well we have
already done it as part of B above).
So E
Have a sorted list in increasing order i.e.
B C D E A F
1 - Insufficient. A = 41 or F = 41 (only 2 possibilities).
If A = 41, yes > 10
If F = 41, the list can be "4 6 7 8 9 41" or "2 6 7 8 11 41"
So insufficient.
2 - Insufficient. List can be same as in 1 i.e. "4 6 7 8 9 41" or
"2 6 7 8 11 41". There are numerous possibilities
Using 1 and 2, we still cannot arrive at a unique value (well we have
already done it as part of B above).
So E
