February 1992 LSAT
Section 3
Question 1
Which one of the following partners cannot have the third highest salary?
Replies
Meredith on August 6, 2019
After some reflecting - is the reason she skips diagraming nine spots and writing deductions because the rules due to the fact the prompt does not say its a one to one relationship between person and salary ranking?Ravi on August 6, 2019
@Meredith,Great question. I'm not sure why she left it out in one of the
explanations, but I think that the easiest way to set this game up is
by making a 9-slot sequence to show where the partners can go.
_ _ _ _ _ _ _ _ _
1 2 3 4 5 6 7 8 9
K goes in 1
K _ _ _ _ _ _ _ _
1 2 3 4 5 6 7 8 9
We then have the two chains
L - N
I - F - M - G - J - H
Note that the two chains are independent; we just need to make sure
that the sequence within each chain is satisfied and we're good to go.
With that general setup, you can fly through the questions pretty quickly.
Does this make sense? Let us know if you have any other questions!
0tas> on June 25, 2020
To build onto this discussion, I have this question: For any pure sequencing game, should I first draw the setup of slots, then diagram the individual rules, then the megachain sequence of all the rules connected to each other, and THEN deduce what can go first and what can go last? If I remember correctly, one Powerscore tutor several months ago suggested that I do not deduce what variables cannot go into certain slots based on the rules. He said that it would take up too much time. What are your thoughts on his advice?BenMingov on June 28, 2020
Hi Otas, thanks for the question.I do believe that making the megachain first and then making deductions makes for far more efficient game completion.
E.g. Three rules that go as follows:
A - B
T and S - B
J - B
On their own, all we know is that B cannot go first or second. But all together, we see that B cannot be within the first four slots.
The megachain is more useful for these deductions.
I hope this helps. Please let us know if you have any other questions.