RankRizz
JEE MAIN 2021 · 16 MAR S1+4 / −1EASYTRANSCRIBED

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

Which of the following Boolean expression is a tautology?

SOLUTION

First recall some basic logical equivalences that we will use repeatedly.

p→qp \rightarrow q is equivalent to ¬p∨q\neg p \vee q   −(1)-(1)
De Morgan’s laws:   ¬(p∧q)=¬p∨¬q\neg(p \wedge q)=\neg p \vee \neg q   and   ¬(p∨q)=¬p∧¬q\neg(p \vee q)=\neg p \wedge \neg q.

We will analyse every option one by one and see whether the statement is always true (tautology) or not.

Case A:

Expression: (p∧q)∨(p∨q)(p \wedge q) \vee (p \vee q)

The term p∨qp \vee q already contains every situation covered by p∧qp \wedge q, so using the absorption law
(p∧q)∨(p∨q)=p∨q(p \wedge q) \vee (p \vee q)=p \vee q.
p∨qp \vee q is not always true (for p=False, q=Falsep=\text{False},\,q=\text{False} it is False).
Hence Option A is NOT a tautology.

Case B:

Expression: (p∧q)∨(p→q)(p \wedge q) \vee (p \rightarrow q)

Using −(1)-(1), rewrite:
(p∧q)∨(¬p∨q)(p \wedge q) \vee (\neg p \vee q).
Group the disjunctions:
=(¬p∨q)∨(p∧q)=(\neg p \vee q) \vee (p \wedge q).
Construct a truth-table for the three literals ¬p, q, p∧q\neg p,\,q,\,p \wedge q (or test the four combinations of p,qp,q):

 • p=T, q=Tp=\text{T},\,q=\text{T}: expression T
 • p=T, q=Fp=\text{T},\,q=\text{F}: ¬p∨q=F, p∧q=F\neg p \vee q=\text{F},\,p\wedge q=\text{F} ⇒\Rightarrow overall F
As it becomes False, the statement is not a tautology. Hence Option B is NOT a tautology.

Case C:

Expression: (p∧q)∧(p→q)(p \wedge q) \wedge (p \rightarrow q)

Again substitute p→q=¬p∨qp \rightarrow q=\neg p \vee q:
(p∧q)∧(¬p∨q)(p \wedge q) \wedge (\neg p \vee q).
If p=F,  q=Tp=\text{F},\;q=\text{T} then the first part p∧q=Fp \wedge q=\text{F}, so whole expression is False. Therefore it is NOT a tautology.

Case D:

Expression: (p∧q)→(p→q)(p \wedge q) \rightarrow (p \rightarrow q)

First convert the implication using −(1)-(1):
(p∧q)→(p→q)=¬(p∧q)∨(p→q)(p \wedge q) \rightarrow (p \rightarrow q)=\neg(p \wedge q) \vee (p \rightarrow q)

Apply De Morgan’s law on the first term and −(1)-(1) on the second term:
=(¬p∨¬q)∨(¬p∨q)=(\neg p \vee \neg q) \vee (\neg p \vee q)

Associativity and commutativity of ∨\vee let us group the literals:
=¬p∨¬q∨q=\neg p \vee \neg q \vee q

But ¬q∨q\neg q \vee q is always True, so

¬p∨(¬q∨q)=¬p∨True=True\neg p \vee (\neg q \vee q)=\neg p \vee \text{True}=\text{True}

Since the expression reduces to True for every choice of pp and qq, it is a tautology.

Therefore, only Option D ((p∧q)→(p→q))\big((p \wedge q) \rightarrow (p \rightarrow q)\big) is a tautology.

Final Answer: Option D.

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