RankRizz
JEE MAIN 2022 · 24 JUN S1+4 / −1MEDIUMTRANSCRIBED

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

The number of choices for Δ∈{∧,∨,⇒,⇔}\Delta \in \{\wedge, \vee, \Rightarrow, \Leftrightarrow\}, such that (pΔq)⇒((pΔ∼q)∨((∼p)Δq))(p \Delta q) \Rightarrow ((p \Delta \sim q) \vee ((\sim p) \Delta q)) is a tautology, is

SOLUTION

We need to find how many choices for Δ∈{∧,∨,⇒,⇔}\Delta \in \{\wedge, \vee, \Rightarrow, \Leftrightarrow\} make (pΔq)⇒((pΔ∼q)∨((∼p)Δq))(p \Delta q) \Rightarrow ((p \Delta \sim q) \vee ((\sim p) \Delta q)) a tautology.

Recall that P⇒QP \Rightarrow Q is false only when PP is true and QQ is false. So the expression is a tautology if whenever (pΔq)(p \Delta q) is true, at least one of (pΔ∼q)(p \Delta \sim q) or (∼pΔq)(\sim p \Delta q) is also true.

Case 1: Δ=∧\Delta = \wedge (AND)

(p∧q)⇒((p∧∼q)∨(∼p∧q))(p \wedge q) \Rightarrow ((p \wedge \sim q) \vee (\sim p \wedge q))

When p=T,q=Tp = T, q = T: LHS = T. RHS = (T∧F)∨(F∧T)=F∨F=F(T \wedge F) \vee (F \wedge T) = F \vee F = F.

So the implication is F. Not a tautology.

Case 2: Δ=∨\Delta = \vee (OR)

(p∨q)⇒((p∨∼q)∨(∼p∨q))(p \vee q) \Rightarrow ((p \vee \sim q) \vee (\sim p \vee q))

RHS: (p∨∼q)∨(∼p∨q)=(p∨∼p)∨(q∨∼q)=T∨T=T(p \vee \sim q) \vee (\sim p \vee q) = (p \vee \sim p) \vee (q \vee \sim q) = T \vee T = T.

Since RHS is always T, the implication is always T. Tautology.

Case 3: Δ=⇒\Delta = \Rightarrow (Implication)

(p⇒q)⇒((p⇒∼q)∨(∼p⇒q))(p \Rightarrow q) \Rightarrow ((p \Rightarrow \sim q) \vee (\sim p \Rightarrow q))

(∼p⇒q)(\sim p \Rightarrow q) is equivalent to (p∨q)(p \vee q). This is false only when p=F,q=Fp = F, q = F.

When p=F,q=Fp = F, q = F: LHS = (F⇒F)=T(F \Rightarrow F) = T. RHS = (F⇒T)∨(T⇒F)=T∨F=T(F \Rightarrow T) \vee (T \Rightarrow F) = T \vee F = T.

When p=T,q=Tp = T, q = T: LHS = T. RHS = (T⇒F)∨(F⇒T)=F∨T=T(T \Rightarrow F) \vee (F \Rightarrow T) = F \vee T = T.

When p=T,q=Fp = T, q = F: LHS = F. So implication is T.

When p=F,q=Tp = F, q = T: LHS = T. RHS = (F⇒F)∨(T⇒T)=T∨T=T(F \Rightarrow F) \vee (T \Rightarrow T) = T \vee T = T.

All cases give T. Tautology.

Case 4: Δ=⇔\Delta = \Leftrightarrow (Biconditional)

(p⇔q)⇒((p⇔∼q)∨(∼p⇔q))(p \Leftrightarrow q) \Rightarrow ((p \Leftrightarrow \sim q) \vee (\sim p \Leftrightarrow q))

Note: (p⇔∼q)=∼(p⇔q)(p \Leftrightarrow \sim q) = \sim(p \Leftrightarrow q) and (∼p⇔q)=∼(p⇔q)(\sim p \Leftrightarrow q) = \sim(p \Leftrightarrow q).

So RHS = ∼(p⇔q)∨∼(p⇔q)=∼(p⇔q)\sim(p \Leftrightarrow q) \vee \sim(p \Leftrightarrow q) = \sim(p \Leftrightarrow q).

The expression becomes: (p⇔q)⇒∼(p⇔q)(p \Leftrightarrow q) \Rightarrow \sim(p \Leftrightarrow q).

When p=T,q=Tp = T, q = T: (T)⇒(F)=F(T) \Rightarrow (F) = F. Not a tautology.

Therefore, exactly 2 choices (∨\vee and ⇒\Rightarrow) make the expression a tautology.

The answer is Option B: 2.

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