Search this site:

LSAT: Questions


College & Grad School


Word of the Day
digress
Definition: (verb) to wander from the main path or the main topic.
Petersons.com
Add Word of the Day to your personalized My Yahoo! page:
Add to My Yahoo! View RSS Feed
About My Yahoo! and RSS »

Math Teaser
Problem
If the cost of a 4-minute telephone call is $0.24, then the cost of a 15-minute call at the same rate is:
Petersons.com

 

LSAT: Logic Games Question #5

Skip to Question: 1 2 3 4 5 6 7 8 9 10  | Next Question

Nine doctoral candidates - Addison, Bailey, Carson, Davis, Elderman, Fuller, Granger, Hymes, and Ingers - will be defending their doctoral theses this week. They may defend their theses on either Monday, Tuesday, or Wednesday. Exactly three candidates will present their theses on each of these days. The following conditions apply:

  • Bailey will defend his thesis on Tuesday.
  • Carson and Fuller must defend their theses on the same day.
  • Addison and Elderman must defend their theses on the same day.
  • Granger and Hymes cannot defend their theses on the same day.
  • Bailey and Ingers cannot defend their theses on the same day.
  • Carson and Ingers cannot defend their theses on the same day.

Question: Which of the following cannot be true:

Choices:
A. Fuller defends her thesis on Monday and Elderman defends his thesis on Monday.
B. Hymes defends her thesis on Tuesday and Granger defends his thesis on Wednesday.
C. Addison defends her thesis on Monday and Ingers defends her thesis on Monday.
D. Carson defends his thesis on Monday and Davis defends her thesis on Wednesday.
E. Ingers defends her thesis on Wednesday and David defends her thesis on Wednesday.



Start out by SEALing the game. The Situation is doctoral candidates defending their theses. The Entities are A, B, C, D, E, F, G, H, and I. The Action is distribution, as we have nine candidates defending on three days, and our task is to figure out who is defending when. Limitations? 3 candidates per day.

Our sketch is pretty simple: 3 days, 3 per slots per day.

M: _ _ _ T: _ _ _ W: _ _ _

Go on to the rules.

The first rule states that B defends his thesis on Tuesday. That is concrete, and can be built directly into the sketch, giving us:

M: _ _ _ T: B _ _ W: _ _ _

The second and third rules are similar in that they dictate two pairs that must always defend their theses on the same day. This is essential. It means that wherever you place A, you must place E as well, and that wherever you C goes, F must follow. You can abbreviate these rules as ALWAYS AE, and ALWAYS CF.

The same principle applies to rules 4, 5, and 6. They tell us about entities that can NEVER be placed together. As such, whenever, you deal with G, always remember that H cannot be placed on the same day, and vice versa. The same goes for B and I and for C and I. You can put these rules in shorthand as NEVER GH, NEVER BI, and NEVER CI, respectively.

It does not seem like we have a whole lot of concrete information to work with - only one concrete rule that could be built into the sketch and no if-then rules to contrapose. But there are still a couple of really important things that we can deduce.

We know that A and E must be together, and that C and F must be together. So can A and C ever be together? No. A and C both carry along baggage (E and F, respectively), and there are only three slots per day, so A and C can never defend their theses on the same day. By the same token, A and F, E and C, and E and F are also all unacceptable.

Also, we know from the rules that C and I cannot be together. We also know that C must always be with F. Therefore, F and I can also never be together.

Update our never list - the list of pairs that can never be together:

NEVER:

G and H
B and I
C and I
F and I
A and C
A and F
E and C
E and F

Several questions hinge on these essential deductions, so if you were able to deduce them before getting into the questions that should have been a huge help. If not, you could still have gotten to the same conclusions indirectly through trial and error.

This question asks which of the following cannot be true. This means that 4 of the choices can be true, and the one correct answer cannot ever be true. Fortunately, this is yet another question that can be answered with a quick glance at our never list.

(A) says F defends on Monday and E defends on Monday. We know that cannot be true. F brings along C and E brings along A, and that would be 4 candidates defending their theses on Monday, when only three are allowed. (A) is therefore the correct answer. If you are not 100% comfortable with that, and if you have enough time, you can verify that (B), (C), (D), and (E) are all acceptable, but it really isn't necessary.
 

*Test names and other trademarks are the property of the respective trademark holders.
Copyright © 2003 by Kaplan, Inc., All Rights Reserved. Kaplan is a registered trademark of Kaplan, Inc.
-