by bbirdwell Fri Feb 17, 2012 3:37 pm
I would suggest diagramming this one. It doesn't take long, and when you see simple conditional statements like these, it's a great idea.
Notice we have no conclusion. Only 3 statements:
cattle rancher --> ~like long winter
resort owner --> like long winter
some lawyers --> cattle ranchers
Then the question stem adds this conclusion:
resort owner --> ~lawyer
Now what we have is essentially a sufficient assumption question. Our job is to connect the dots in such a way that the conclusion given in the question stem is made correct.
The only way we can prove that resort owners are definitely not lawyers is to somehow prove that lawyers do NOT like long winters.
Something like "no lawyers like long winters" would do this:
lawyer --> ~like long winter.
Given that this is the LSAT, things are unlikely to be so simple when the test-writers could add one extra step. That extra step is to use "cattle ranchers" as a middle-man between lawyers and winters.
Just as "no lawyers like long winters" would suffice, so would "no lawyers is a cattle rancher," because this arrives at the same result:
lawyer --> cattle rancher --> ~like long winters
This is exactly what C does, and none of the others comes close.
As a quick elimination game, we could've eliminated every choice that did not contain either "lawyers and long winters" or "lawyers and cattle ranchers". This alone would've gotten us to A and C. Then, as timmy pointed out, we'd have to choose C because the argument already gave us A ("some" is a two-way street; if we know some A are B, then we know that some B are A).