RankRizz
JEE MAIN 2023 · 08 APR S2+4 / −1EASYTRANSCRIBED

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

The negation of (p∧(−q))∨(−p)(p \wedge (-q)) \vee (-p) is equivalent to

SOLUTION

We need to find the negation of (p∧(¬q))∨(¬p)(p \wedge (\neg q)) \vee (\neg p).

Simplify the given expression.

Using the distributive law, we expand:

(p∧(¬q))∨(¬p)=(¬p∨p)∧(¬p∨¬q)(p \wedge (\neg q)) \vee (\neg p) = (\neg p \vee p) \wedge (\neg p \vee \neg q)

Since ¬p∨p\neg p \vee p is a tautology (always true):

=T∧(¬p∨¬q)=¬p∨¬q= T \wedge (\neg p \vee \neg q) = \neg p \vee \neg q

Apply De Morgan's Law.

By De Morgan's Law, ¬p∨¬q=¬(p∧q)\neg p \vee \neg q = \neg(p \wedge q). So:

(p∧(¬q))∨(¬p)≡¬(p∧q)(p \wedge (\neg q)) \vee (\neg p) \equiv \neg(p \wedge q)

Find the negation.

The negation of ¬(p∧q)\neg(p \wedge q) is:

¬[¬(p∧q)]=p∧q\neg[\neg(p \wedge q)] = p \wedge q

Verification using truth table:

When p=T,q=Tp = T, q = T: Original = (T∧F)∨F=F(T \wedge F) \vee F = F. Negation = TT. And p∧q=Tp \wedge q = T. ✔

When p=T,q=Fp = T, q = F: Original = (T∧T)∨F=T(T \wedge T) \vee F = T. Negation = FF. And p∧q=Fp \wedge q = F. ✔

When p=F,q=Tp = F, q = T: Original = (F∧F)∨T=T(F \wedge F) \vee T = T. Negation = FF. And p∧q=Fp \wedge q = F. ✔

When p=F,q=Fp = F, q = F: Original = (F∧T)∨T=T(F \wedge T) \vee T = T. Negation = FF. And p∧q=Fp \wedge q = F. ✔

The negation matches p∧qp \wedge q in all cases.

The answer is Option B: p∧qp \wedge q.

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