actually, yes, there's a quite potent strategy based on this idea: the strategy of eliminating the "c trap".
a c trap is a problem that's clearly written to be difficult, but on which both statements taken together are VERY CLEARLY sufficient.
and by VERY CLEARLY i don't mean "after i solve this equation, and move that over there, then ... oh yeah, my memorized rule of thumb tells me they're sufficient" - i mean it's OBVIOUS. (examples follow, for those of you who have your og's handy.)
on these problems, you can rest assured that (c) is not the answer. also, because the two statements together are sufficient, you can also strike answer (e).
this leaves only (a), (b), (d). and in the dream situation, in which one of the answers by itself is clearly insufficient, then you can guess that the other one must be sufficient - and you'll be right a startlingly high percentage of the time.
you should NOT use the "c trap" approach as a PRIMARY method - i'm sure that, one fine day, a difficult "c trap" problem will come along to which the answer actually is 'c' (although i've yet to see one) - but, rather, as an AID TO GUESSING.
still, if you get into a guessing situation, the c trap is one of the strongest weapons in your arsenal.
--
i'll illustrate two c traps from the og 11th edition (yellow book). i won't write out the problems themselves - don't want to step on any copyright toes - so, class, please get out your og11's and follow along.
DS PROBLEM 129:
* identify the problem as a c trap: if you take the two statements together, then you have values for ALL of the numbers in the problem (a, b, n). if you have specific values, then the answer will obviously be "yes" or "no"; hence, sufficient.
kill (c) and (e) and narrow the choices to (a), (b), and (d).
* statement (2) is clearly insufficient.
kill (b) and (d).
answer = a.
DS PROBLEM 150:
* identify the problem as a c trap: if you take the two statements together, then you have the prices of ALL the items in the problem. if that's the case, then the answer to the prompt question is clearly either "yes" or "no"; hence, sufficient.
kill (c) and (e) and narrow the choices to (a), (b), and (d).
* statement (2) is insufficient. this isn't nearly as obvious as it is for the aforementioned problem #129, but the presence of two remaining unknowns should convince you (remember that you're in guessing mode here).
kill (b) and (d).
answer = a.
--
class dismissed.
Ron has been teaching various standardized tests for 20 years.
--
Pueden hacerle preguntas a Ron en castellano
Potete chiedere domande a Ron in italiano
On peut poser des questions à Ron en français
Voit esittää kysymyksiä Ron:lle myös suomeksi
--
Quand on se sent bien dans un vêtement, tout peut arriver. Un bon vêtement, c'est un passeport pour le bonheur.
Yves Saint-Laurent
--
Learn more about ron
