RankRizz
JEE MAIN 2021 · 17 MAR S1+4 / −1MEDIUMTRANSCRIBED

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

If the Boolean expression (p⇒q)⇔(q∗(∼p))(p \Rightarrow q) \Leftrightarrow (q * (\sim p)) is a tautology, then the Boolean expression p∗(∼q)p * (\sim q) is equivalent to:

SOLUTION

We are given that (p⇒q)⇔(q∗(∼p))(p \Rightarrow q) \Leftrightarrow (q * (\sim p)) is a tautology, and we need to find what p∗(∼q)p * (\sim q) is equivalent to.

Recall the standard logical equivalence: p⇒q≡∼p∨qp \Rightarrow q \equiv \sim p \lor q. This means "if p then q" is the same as "not-p or q".

For the biconditional (p⇒q)⇔(q∗(∼p))(p \Rightarrow q) \Leftrightarrow (q * (\sim p)) to be a tautology, both sides must always have the same truth value. So we need ∼p∨q≡q∗(∼p)\sim p \lor q \equiv q * (\sim p) for every combination of truth values of pp and qq.

Let us substitute a=∼pa = \sim p to simplify. Then we need a∨q≡q∗aa \lor q \equiv q * a for all truth values of aa and qq. Since aa and qq range over all truth values independently (as pp and qq do), this means the operation ∗* must be exactly the same as ∨\lor (OR).

To verify with a truth table: when a=T,q=Ta = T, q = T: a∨q=Ta \lor q = T so q∗a=Tq * a = T. When a=T,q=Fa = T, q = F: a∨q=Ta \lor q = T so q∗a=Tq * a = T. When a=F,q=Ta = F, q = T: a∨q=Ta \lor q = T so q∗a=Tq * a = T. When a=F,q=Fa = F, q = F: a∨q=Fa \lor q = F so q∗a=Fq * a = F. This matches the OR truth table exactly.

Now we evaluate p∗(∼q)p * (\sim q). Since ∗* is ∨\lor, we get p∗(∼q)=p∨(∼q)p * (\sim q) = p \lor (\sim q).

Using the equivalence q⇒p≡∼q∨p=p∨(∼q)q \Rightarrow p \equiv \sim q \lor p = p \lor (\sim q), we see that p∗(∼q)≡q⇒pp * (\sim q) \equiv q \Rightarrow p.

This matches Option A: q⇒pq \Rightarrow 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