GMATPrep question

This topic has expert replies
Master | Next Rank: 500 Posts
Posts: 135
Joined: Tue Feb 27, 2007 7:21 pm
Thanked: 2 times

GMATPrep question

by rajesh_ctm » Thu Apr 26, 2007 8:11 pm
How to approach these types?
Attachments
GMATPrep.JPG

User avatar
Master | Next Rank: 500 Posts
Posts: 400
Joined: Sat Mar 10, 2007 4:04 am
Thanked: 1 times
Followed by:1 members

by f2001290 » Thu Apr 26, 2007 8:42 pm
What is the solution ? Is it "E"

If you can confirm the solution, I can tell the approach.

Master | Next Rank: 500 Posts
Posts: 135
Joined: Tue Feb 27, 2007 7:21 pm
Thanked: 2 times

by rajesh_ctm » Thu Apr 26, 2007 8:44 pm
Yes, it is E.

User avatar
Community Manager
Posts: 789
Joined: Sun Jan 28, 2007 3:51 pm
Location: Silicon valley, California
Thanked: 30 times
Followed by:1 members

by jayhawk2001 » Thu Apr 26, 2007 10:19 pm
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