LG Game 1 Question 4 Explanation, by LSATHacks
It’s helpful to draw a diagram to solve this question. Let’s try assigning R to locker 1.
We can’t assign J to locker 1, because R is there and R has to be alone. We can’t assigned J to locker 3, because F is there and two boys can’t share.
But there’s no reason J can’t be assigned to lockers 2, 4 or 5. No matter where we put J, we just have to put the other shared locker somewhere else, and we obey all the rules.
So if we put R in 1, we can put J in three lockers. We can be sure that this is the maximum, because J can never go with R or F, no matter where we place R.
C is CORRECT.
Hi, I'm Graeme Blake
Founder of LSAThacks; I scored a 177 on the LSAT.
I created the LSAT Mastery Seminars, which are part of the Ultimate LSAT Prep Bundle
If you like the explanations you're reading I'm 100% confident you'll enjoy the courses. Satisfaction guaranteed.
---------
Updates:
For updates, sign up for my email list. I update whenever I have new posts.
Leave a Reply