RankRizz
JEE MAIN 2022 · 29 JUL S2+4 / −1MEDIUMTRANSCRIBED

JEE Main 2022 Mathematics question — Logical connectives, truth tables and tautologies

The statement (p⇒q)∨(p⇒r)(p \Rightarrow q) \vee (p \Rightarrow r) is NOT equivalent to:

SOLUTION

We need to determine which statement is NOT equivalent to (p⇒q)∨(p⇒r)(p \Rightarrow q) \vee (p \Rightarrow r).

We first simplify the given statement. We know p⇒q≡∼p∨qp \Rightarrow q \equiv \sim p \vee q and p⇒r≡∼p∨rp \Rightarrow r \equiv \sim p \vee r. So (p⇒q)∨(p⇒r)≡(∼p∨q)∨(∼p∨r)≡∼p∨q∨r(p \Rightarrow q) \vee (p \Rightarrow r) \equiv (\sim p \vee q) \vee (\sim p \vee r) \equiv \sim p \vee q \vee r. This is equivalent to p⇒(q∨r)p \Rightarrow (q \vee r).

Now we check each option:

Option A: (p∧∼r)⇒q≡∼(p∧∼r)∨q≡∼p∨r∨q(p \wedge \sim r) \Rightarrow q \equiv \sim(p \wedge \sim r) \vee q \equiv \sim p \vee r \vee q. This equals ∼p∨q∨r\sim p \vee q \vee r. Equivalent.

Option B: ∼q⇒(∼r∨p)≡q∨∼r∨p\sim q \Rightarrow (\sim r \vee p) \equiv q \vee \sim r \vee p. This is p∨q∨∼rp \vee q \vee \sim r, which is NOT the same as ∼p∨q∨r\sim p \vee q \vee r. For example, when p=T,q=F,r=Tp = T, q = F, r = T: our expression gives F∨F∨T=TF \vee F \vee T = T, but Option B gives T∨F∨F=TT \vee F \vee F = T. Try p=T,q=F,r=Fp = T, q = F, r = F: our expression gives F∨F∨F=FF \vee F \vee F = F, but Option B gives T∨F∨T=TT \vee F \vee T = T. So they differ. NOT equivalent.

Option C: p⇒(q∨r)≡∼p∨q∨rp \Rightarrow (q \vee r) \equiv \sim p \vee q \vee r. Equivalent (same as our simplified form).

Option D: (p∧∼q)⇒r≡∼(p∧∼q)∨r≡∼p∨q∨r(p \wedge \sim q) \Rightarrow r \equiv \sim(p \wedge \sim q) \vee r \equiv \sim p \vee q \vee r. Equivalent.

Hence, the correct answer is Option B: ∼q⇒(∼r∨p)\sim q \Rightarrow (\sim r \vee p).

Tagged Logical connectives, truth tables and tautologies. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicLogical connectives, truth tables and tautologies
TypeMultiple choice