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

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

Let r∈(P,q,∼p,∼q)r \in (P, q, \sim p, \sim q) be such that the logical statement r∨(∼p)⇒(p∧q)∨rr \vee (\sim p) \Rightarrow (p \wedge q) \vee r is a tautology. Then rr is equal to

SOLUTION

First, we need to find r∈{p,q,∼p,∼q}r \in \{p, q, \sim p, \sim q\} such that r∨(∼p)⇒(p∧q)∨rr \vee (\sim p) \Rightarrow (p \wedge q) \vee r is a tautology.

Next, recall that an implication P⇒QP \Rightarrow Q is a tautology when QQ is true whenever PP is true. Therefore, we need: whenever r∨(∼p)r \vee (\sim p) is true, (p∧q)∨r(p \wedge q) \vee r must also be true.

Now, test r=∼pr = \sim p. The statement becomes:

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

Substituting, this simplifies to:

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

Since the implication must hold in all cases, consider the following:

Case 1: pp is True (so ∼p\sim p is False). The implication F⇒anythingF \Rightarrow \text{anything} is True.

Case 2: pp is False (so ∼p\sim p is True). The RHS becomes (F∧q)∨T=T(F \wedge q) \vee T = T. So T⇒TT \Rightarrow T is True.

Since the implication is true in all cases, it is a tautology. ✓

Next, verify that the other options fail.

For r=pr = p: Let p=F,q=Fp = F, q = F. Then LHS: F∨T=TF \vee T = T, RHS: (F∧F)∨F=F(F \wedge F) \vee F = F. So T⇒FT \Rightarrow F is False. ✗

For r=qr = q: Let p=F,q=Fp = F, q = F. Then LHS: F∨T=TF \vee T = T, RHS: (F∧F)∨F=F(F \wedge F) \vee F = F. So T⇒FT \Rightarrow F is False. ✗

For r=∼qr = \sim q: Let p=T,q=Tp = T, q = T. Then LHS: F∨F=FF \vee F = F, so implication is True. Let p=F,q=Tp = F, q = T. Then LHS: F∨T=TF \vee T = T, RHS: (F∧T)∨F=F(F \wedge T) \vee F = F. So T⇒FT \Rightarrow F is False. ✗

Therefore, the answer is Option C: ∼p\sim 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