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

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

If the Boolean expression (p∧q)⊛(p⊗q)(p \wedge q) \circledast (p \otimes q) is a tautology, then ⊛\circledast and ⊗\otimes are respectively given by:

SOLUTION

We need to find the connectives ⊛\circledast and ⊗\otimes such that (p∧q)⊛(p⊗q)(p \wedge q) \circledast (p \otimes q) is a tautology.

Let us check Option A: ⊛\circledast is →\to and ⊗\otimes is →\to. The expression becomes (p∧q)→(p→q)(p \wedge q) \to (p \to q).

Recall that an implication A→BA \to B is false only when AA is true and BB is false. So (p∧q)→(p→q)(p \wedge q) \to (p \to q) is false only when (p∧q)(p \wedge q) is true and (p→q)(p \to q) is false.

If (p∧q)(p \wedge q) is true, then both pp and qq are true. But when pp is true and qq is true, (p→q)(p \to q) is also true. So the antecedent being true forces the consequent to be true as well.

Therefore (p∧q)→(p→q)(p \wedge q) \to (p \to q) can never be false, making it a tautology.

Let us verify the other options fail. For Option B (⊛=∧\circledast = \wedge, ⊗=∨\otimes = \vee): the expression is (p∧q)∧(p∨q)(p \wedge q) \wedge (p \vee q). When p=T,q=Fp = T, q = F: (T∧F)∧(T∨F)=F∧T=F(T \wedge F) \wedge (T \vee F) = F \wedge T = F. Not a tautology.

For Option C (⊛=∨\circledast = \vee, ⊗=→\otimes = \to): the expression is (p∧q)∨(p→q)(p \wedge q) \vee (p \to q). When p=T,q=Fp = T, q = F: (T∧F)∨(T→F)=F∨F=F(T \wedge F) \vee (T \to F) = F \vee F = F. Not a tautology.

For Option D (⊛=∧\circledast = \wedge, ⊗=→\otimes = \to): the expression is (p∧q)∧(p→q)(p \wedge q) \wedge (p \to q). When p=F,q=Fp = F, q = F: (F∧F)∧(F→F)=F∧T=F(F \wedge F) \wedge (F \to F) = F \wedge T = F. Not a tautology.

The answer is →,→\to, \to, which is Option A.

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