RankRizz
JEE MAIN 2022 · 27 JUN S2+4 / −1EASYTRANSCRIBED

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

Which of the following statement is a tautology?

SOLUTION

We need to identify which of the given statements is a tautology (always true regardless of truth values of pp and qq).

Analyze Option A: ((∼q)∧p)∧q((\sim q) \wedge p) \wedge q

This simplifies to p∧q∧(∼q)p \wedge q \wedge (\sim q), which contains q∧(∼q)=Fq \wedge (\sim q) = F.

So this is always False (contradiction). Not a tautology.

Analyze Option B: ((∼q)∧p)∧(p∧(∼p))((\sim q) \wedge p) \wedge (p \wedge (\sim p))

The term p∧(∼p)=Fp \wedge (\sim p) = F.

So the entire expression is (anything)∧F=F(\text{anything}) \wedge F = F.

This is always False (contradiction). Not a tautology.

Analyze Option C: ((∼q)∧p)∨(p∨(∼p))((\sim q) \wedge p) \vee (p \vee (\sim p))

The term p∨(∼p)=Tp \vee (\sim p) = T (this is a tautology by itself).

So the entire expression is (anything)∨T=T(\text{anything}) \vee T = T.

This is always True. This is a tautology!

Analyze Option D: (p∧q)∧(∼(p∧q))(p \wedge q) \wedge (\sim(p \wedge q))

Let r=p∧qr = p \wedge q. Then this becomes r∧(∼r)=Fr \wedge (\sim r) = F.

This is always False (contradiction). Not a tautology.

Therefore, the tautology is Option C: ((∼q)∧p)∨(p∨(∼p))((\sim q) \wedge p) \vee (p \vee (\sim p)).

The correct answer is Option C.

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