June 2011 LSAT
Section 2
Question 6

June 2011 LSAT
Section 2
Question 6

Reply

Skylar on December 27, 2019

@shafieiava, happy to help!This is a linear sequencing game with six variables. We can diagram it as:

LOPTWZ

__ __ __ __ __ __

1 2 3 4 5 6

The rules can be written as:

(1) T > W

(2) L = 1 or 6

(3) 6 NOT= W, Z

(4) O>P>L OR L>P> O

Our new diagram looks like:

__ __ __ __ __ __

1 2 3 4 5 6

not W

not Z

Using Rule #2, we can create two scenarios- one where L is first and another where L is last.

Scenario 1:

L __ __ __ __ O

1 2 3 4 5 6

In spots 2-5, we would have Z, T>W, and P in some arrangement. We know that O has to be last because Rule #3 eliminates W and L as options, L is already placed elsewhere, and T and P must precede other variables (according to Rule #1 and Rule #4). This only leaves O.

Scenario 2:

__ __ __ __ __ L

1 2 3 4 5 6

In spots 1-5, we would have Z, T>W, and O>P in some arrangement.

Now, let's look at this question. We can approach this type of question by going through each of our rules and eliminating answer choices that violate them.

- Rule #1 eliminates (C) because W precedes T.

- Rule #2 eliminates (E) because L is not first or last.

- Rule #3 eliminates (A) because W is in the last spot.

- Rule #4 eliminates (D) because P is before both O and L.

This only leaves (B), which meets all of the rules and is therefore correct.

Does that make sense? Let us know if you have additional questions or would like explanations for any of the other questions within this game. Best of luck with your studies!

GET $100

GET $200