Quant BY NARENDRA SHEKHAWAT

www.facebook.com/godofmaths
Binary means consisting of two. Binary logic conce t !asically "eals wit# t#e statements w#ic# are eit#er true or false. So we #a$e to c#ec% t#e $ali"ity of t#e statements to come to a conclusion. We may also fin" t#e com!ination of statements w#ic# may !e eit#er all true& all false or some true an" some false. T#e erson w#o ma%es t#ese statements comes un"er t#e following #ea"s. (1)Truth Teller-T#is %in" of erson always s ea% trut#. So w#ate$er statements #e ma%es are always assume" to !e true. (2)Liar-T#is %in" of erson always lies. So w#ate$er statements #e ma%es are always assume" to !e false. (3)Alternator-T#is %in" of erson alternates !etween trut# an" false. 'f t#is erson ma%es two statements t#en any one of t#em will !e true an" t#e ot#er will !e false. T#e (uestion will not tell us as to w#ic# erson is ma%ing t#e statement)*s+. Now t#e (uestion arises #ow are we going to come to a conclusion. T#e answer is sim le we are going to list out all t#e ossi!ilities an" eliminate all t#ose w#ic# lea"s to contra"iction for w#at we #a$e assume". Sometimes e$en after listing all t#e con"itions we see t#at it "oes not in"icate w#ic# one of t#e ossi!ility is $ali" an" w#ic# one is not& in t#is %in" of situation e,aminer will not as% a!out w#ic# one is "efinitely true !ut instea" #e may as% w#ic# one is "efinitely false& w#ic# can !e answere" sim ly !y e,amining all t#e ossi!le an" $ali" con"itions. Before going into more "etails& we s#all analy-e some sim le statements an" t#en rocee" furt#er. .' am a trut# teller/. T#is statement can !e ma"e !y a trut#0teller& a liar or an alternator. .' am a liar/. Now t#is articular statement can ne$er !e ma"e !y a trut#0teller !ecause erson w#o is a trut#0teller woul" not say t#at #e is a liar. E$en t#e liar woul" not ma%e t#is %in" of statement an" say t#at #e is a liar. So t#is statement can only !e ma"e !y an alternator. Howe$er t#is statement is false !ut it still tells us t#at it is ma"e !y an alternator. So w#ate$er ne,t statement #e is going to ma%e will !e true. .' am an alternator/ T#is statement can ne$er !e ma"e !y a trut#0teller so we will not list t#e ossi!ility in w#ic# t#is articular erson is assume" to !e a trut#0teller. Now let us un"erstan" t#is conce t !y ta%ing some e,am les. Example 1: T#ere are t#ree !rot#ers Sonu& 1onu an" Teenu. Among t#em one is a liar& one is a trut#0teller an" t#e ot#er is an alternator. T#ey ma"e t#e following statements. Sonu2 ' am an alternator. 1onu is a liar. Teenu2 ' am not a liar. Sonu is a liar. 1onu2 ' am a liar. Teenu is a trut#0teller. 3in" out t#e category of eac# erson4 Sol: 5learly we "on6t nee" to list out all t#e ossi!ilities !ecause 1onu sai" t#at #e is a liar w#ic# clearly in"icates t#at #e is an alternator. So #is ot#er statement must !e true. T#erefore Teenu is a trut#0teller an" Sonu is a liar. Example 2: 5ommissioner of olice e,amines t#ree sus ects engage" in smuggling an" as%s t#em few (uestions a!out t#e lane w#ic# is yet to arri$e. 't is %nown t#at eac# one of t#e sus ect ma"e two statements one of w#ic# was true an" t#e ot#er was false. T#eir answers were as follows2 A: 7lane will arri$e at 8 m. 'ts colour is re" only. B: 7lane will arri$e at 8 m. 'ts colour is !lue only. C: ' %now at w#at time lane arri$es. B is lying a!out t#e time of arri$al. 3in" out at w#at time "oes t#e lane arri$es an" w#at is t#e colour of t#e lane4 Sol: 9et us assume t#at lane arri$es at 8 m so ot#er two statement of !ot# A an" B must !e false t#at means colour can neit#er !e re" nor !e !lue. 5 %nows a!out t#e time of arri$al an" #e says B is lying w#ic# is a false statement. T#is "oes not lea"s to any contra"iction for w#ate$er we #a$e assume". Now let us ta%e anot#er ossi!ility t#at !ot# A an" B are lying a!out t#e time t#en t#eir ne,t statement must !e true. So colour will !e re" only accor"ing to A an" !lue only accor"ing to B w#ic# lea"s to contra"iction as colour can6t !e re" only as well as !lue only at t#e same time. So after listing all t#e con"itions we

facebook.com/djnarsa4u

come to conclusion t#at lane will arri$e at 8 m !ut no conclusion can !e "rawn a!out t#e colour of t#e lane !ut it can !e sai" t#at "efinitely t#at it will not !e re" only or !lue only. Example 3: 'n a family t#ree mem!ers were (uarrelling a!out w#o #as goggles an" w#o wears t#e s#oes. T#ey #a$e a eculiar #a!it t#at out of t#e two statements t#ey ma%e one of t#eir statement is true an" t#e ot#er is false. W#en as%e" a!out w#o wears t#e s#oes t#eir re lies were as follows4 A: ' #a$e t#e s#oes. 5 is #a$ing t#e goggles. B: ' am #a$ing t#e goggles. ' #a$e t#e s#oes. C: ' #a$e t#e s#oes. ' am not #a$ing t#e goggles. :n t#e !asis of a!o$e statements fin" out w#o is #a$ing t#e goggles an" w#o is #a$ing t#e s#oes4 Sol: 9et us first assume first statement of A !e true t#at means ot#er statement must !e false t#erefore 5 is not #a$ing t#e goggles w#ic# is also t#e secon" statement of 5 so #is ot#er statement must !e false an" #e "oes not #a$e s#oes. Now secon" statement of B is also false for w#at we #a$e assume" t#en #is ot#er statement must !e true w#ic# means #e is #a$ing goggles. So far we not seen any contra"iction. Now let us analy-e ot#er situation in w#ic# B is not #a$ing goggles an" #is ot#er statement must !e true t#at means #e is #a$ing s#oes. A "oes not #a$e s#oes an" ot#er statement of A must !e true w#ic# is t#at 5 is #a$ing t#e goggles. But 5 says #e is #a$ing s#oes w#ic# is false t#erefore #is ot#er statement must !e true an" #e is not #a$ing goggles w#ic# lea"s to contra"iction for w#at we #a$e assume". 9et us analy-e t#e last con"ition w#ic# is 5 is #a$ing t#e s#oes let it !e true t#en ot#er statement of 5 is false w#ic# means #e is also #a$ing t#e goggles. Also secon" statement of B is t#at #e is #a$ing s#oes is false t#en #is ot#er statement must !e true w#ic# says t#at #e is #a$ing goggles. T#is again lea"s to contra"iction as 5 is also #a$ing goggles so !ot# can6t !e true at t#e same time.

After analy-ing all t#e ossi!ilities we #a$e seen only t#e first one "oes not lea"s to contra"iction. So clearly we can see t#at A is #a$ing s#oes an" B is #a$ing goggles. Example 4: A& B& 5 an" D were as%e" a!out t#eir mar%s in 7#ysics& 5#emistry& 1at#s an" 5om uter. Eac# one of t#em ga$e ; statements. 't is %nown t#at statements are alternately true an" false& also it is %nown t#at total num!er of true statements are e(ual to total num!er of false statements. T#ey ma"e t#e following statements. A2 ' got #ig#est in 7#ysics. B got #ig#est in 5#emistry. D got #ig#est in 5om uter. B2 5 got lowest in 7#ysics. ' got lowest in 1at#s. A got <n" #ig#est in 7#ysics. 52 D got lowest in 5#emistry. B got lowest in 5om uter. A got #ig#est in 1at#s. D2 ' got #ig#est in 7#ysics. B got lowest in 5#emistry. 5 got <n" lowest in 5om uter. No two ersons got same mar%s in any of t#e su!=ect. Now answer (uestions !ase" on t#e a!o$e "ata. Example 4: W#o got <n" #ig#est in 5#emistry4 )>+ A )<+ B );+ 5 )?+ D )@+ Eit#er A or B Example 5: W#o got lower mar%s t#an D in 7#ysics !ut #ig#er in all t#e ot#er su!=ects4 )>+ B )<+ 5 );+ A )?+ 5 A A )@+ B A A Example 6: W#o got secon" lowest in 5om uter4 )>+ A )<+ B );+ 5 )?+ D )@+ 5an6t !e "etermine" Example : How many ersons got more mar%s t#an D in 5#emistry4 )>+ > )<+ < );+ ; )?+ B )@+ Eit#er > or < Sol 3- : Num!er of false statements are e(ual to num!er of false statements also statements are in t#e or"er of false& true an" false or true& false an" true t#erefore first statement !y e,actly two ersons is true. 'f we are going to list out all t#e ossi!le com!inations t#en we are going to !uil" a too com licate" situation for oursel$es. So t#e !est way is to see t#e

50<@& NEW C'DHAN SABHA R:AD& DA'7ER& 7#one num!er B>?>0 ?B8>?>? * ?B8>?>@& $isit us at2 www.%ingse"ucation.in 0<0

!est ossi!le com!ination w#ic# will eliminate t#e nee" to c#ec% all t#e ossi!ilities. :n closely analy-ing t#e statements we see t#at two eo le are claiming to get #ig#est mar%s in 7#ysics so !ot# of t#em can6t !e true e$en !ot# of t#em can6t !e false !ecause it will gi$e us t#e com!ination of 5 as T3T an" of D as 3T3. Now if we c#ec% t#e >st statement of 5 an" <n" statement of D t#en it lea"s to two ersons getting lowest in c#emistry w#ic# is contra"ictory. So ossi!le com!ination of A an" D is T3T A 3T3 or 3T3 A T3T . 'f we ta%e first statement of A to !e true t#en ;r" statement of B #as to !e false so& or"er of B will !e 3T3. So or"er of 5 will !e T3T& t#is in turn again lea"s to contra"iction a!out mar%s in 5#emistry. So only ossi!le com!ination left is A)3T3+& B

50<@& NEW C'DHAN SABHA R:AD& DA'7ER& 7#one num!er B>?>0 ?B8>?>? * ?B8>?>@& $isit us at2 www.%ingse"ucation.in 0;0