Page 1 of 1
Help on PT 31 LG #2
Posted: Tue Mar 16, 2010 9:47 pm
by hellojd
Hey guys,
Really struggling on this LG, particularly questions 12-13. Could someone please assist?
On 12, I don't have any inference to use...
Re: Help on PT 31 LG #2
Posted: Wed Mar 17, 2010 12:04 am
by worldwithoutend
I must miss these...
Question 12 comes down to the fourth rule: ~Nj + ~Uj --> Np
We know that Np (New pop) is NOT on sale, because Ns is the only new CD on sale.
The contrapositive of the fourth rule is: ~Np --> Nj OR Uj (or both)
So one of Nj or Uj MUST be on sale. And we know that it CAN'T be Nj, because Np is the only New CD.
Therefore, Uj must be on sale.
Re: Help on PT 31 LG #2
Posted: Fri Mar 19, 2010 12:00 pm
by waxecstatic
hellojd wrote:Hey guys,
Really struggling on this LG, particularly questions 12-13. Could someone please assist?
On 12, I don't have any inference to use...
Oh yeah, the CD game is one of the toughest games I've seen. Need to know the either or as well as "and" contrapositives and even then you have to make a lot of inferences to get anywhere.
Re: Help on PT 31 LG #2
Posted: Fri Mar 19, 2010 5:16 pm
by Atlas LSAT Teacher
The diagram I'm attaching makes people balk, but if you know our diagram system, it really breaks this game apart. Tough game though -- sort of a classic in the ass-kicker category.
http://www.atlaslsat.com/forums/june-20 ... e53af67adc
Re: Help on PT 31 LG #2
Posted: Sat Mar 20, 2010 1:52 am
by r6_philly
That diagram is over complicated. I wrote logical statements that are very easy to follow.
conditions:
Pu + Pn -> Su + Sn
Ju + Jn -> !Ru + !Rn
!Ju + !Jn -> Pn
Ru/Rn -> !Su + !Sn
So 12:
if Sn is only new type then
!Jn + !On + !Rn + !Pn
!Pn -> Ju/Jn (rule 3), because Jn not onsale (see line above) then Ju must be on sale.
Re: Help on PT 31 LG #2
Posted: Sat Mar 20, 2010 8:21 am
by Atlas LSAT Teacher
r6_philly wrote:That diagram is over complicated.
Yup, it is a doozy! Every diagram system has its weakness, and this game exposes the weakness of this one.
Nice clean write-up.
Re: Help on PT 31 LG #2
Posted: Sat Mar 20, 2010 10:21 am
by r6_philly
Atlas LSAT Teacher wrote:r6_philly wrote:That diagram is over complicated.
Yup, it is a doozy! Every diagram system has its weakness, and this game exposes the weakness of this one.
Nice clean write-up.
lol when I see stuff like that my brain wants to take a walk outside
it is helpful to figure out the logical connections between multiple, overlapping conditions by drawing diagrams, but I think only during studying. By the time one takes the real test they should be able to see the logical conclusions and inferrences without writing them out. From a computer programmer point of view, this game is super easy because it is just a set of if/then/else statements. The trick to 12 is to infer that all other new cds are not on sale, writing the ! statement down can help you go through the conditions quickly. So is 13.
Re: Help on PT 31 LG #2
Posted: Mon Mar 22, 2010 12:03 pm
by hellojd
r6_philly wrote:Atlas LSAT Teacher wrote:r6_philly wrote:That diagram is over complicated.
Yup, it is a doozy! Every diagram system has its weakness, and this game exposes the weakness of this one.
Nice clean write-up.
lol when I see stuff like that my brain wants to take a walk outside
it is helpful to figure out the logical connections between multiple, overlapping conditions by drawing diagrams, but I think only during studying. By the time one takes the real test they should be able to see the logical conclusions and inferrences without writing them out. From a computer programmer point of view, this game is super easy because it is just a set of if/then/else statements. The trick to 12 is to infer that all other new cds are not on sale, writing the ! statement down can help you go through the conditions quickly. So is 13.
Thanks a lot for the help guys. Glad to know I wasn't just imagining that this game was hard haha.