RankRizz
JEE MAIN 2020 · 03 SEP S1+4 / −1EASYTRANSCRIBED

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

The proposition p→∼(p∧∼q)p \to \sim(p \wedge \sim q) is equivalent to:

SOLUTION

We have to simplify the proposition p→∼(p∧∼q)p \to \sim(p \wedge \sim q) and then compare the final result with the four given options.

First recall the logical equivalence for an implication. The standard formula is:

a→b≡(∼a)∨b.a \to b \equiv (\sim a) \vee b.

In our problem the role of aa is played by pp and the role of bb is played by ∼(p∧∼q).\sim(p \wedge \sim q). Substituting into the formula we obtain

p→∼(p∧∼q)≡(∼p)∨[  ∼(p∧∼q)].p \to \sim(p \wedge \sim q) \equiv (\sim p) \vee \bigl[\;\sim(p \wedge \sim q)\bigr].

Now we tackle the term ∼(p∧∼q)\sim(p \wedge \sim q). To simplify a negation of a conjunction, we use De Morgan’s law, which states:

∼(A∧B)≡(∼A)∨(∼B).\sim(A \wedge B) \equiv (\sim A) \vee (\sim B).

Here AA is pp and BB is ∼q\sim q. Applying the law carefully gives

∼(p∧∼q)≡(∼p)∨[∼(∼q)].\sim(p \wedge \sim q) \equiv (\sim p) \vee \bigl[\sim(\sim q)\bigr].

A double negation disappears, because ∼(∼q)≡q\sim(\sim q) \equiv q. Hence the entire right-hand side becomes

∼(p∧∼q)≡(∼p)∨q.\sim(p \wedge \sim q) \equiv (\sim p) \vee q.

We now substitute this back into the expression we obtained after the implication step:

(∼p)∨[  ∼(p∧∼q)]≡(∼p)∨[(∼p)∨q].(\sim p) \vee \bigl[\;\sim(p \wedge \sim q)\bigr] \equiv (\sim p) \vee \bigl[(\sim p) \vee q\bigr].

The disjunction is associative and idempotent, meaning that repeating the same statement inside a string of ORs does not change the result. Explicitly,

(∼p)∨(∼p)≡∼p,and(∼p)∨[(∼p)∨q]≡(∼p)∨q.(\sim p) \vee (\sim p) \equiv \sim p, \quad\text{and}\quad (\sim p) \vee \bigl[(\sim p) \vee q\bigr] \equiv (\sim p) \vee q.

Therefore the original proposition simplifies all the way down to

p→∼(p∧∼q)≡(∼p)∨q.p \to \sim(p \wedge \sim q) \equiv (\sim p) \vee q.

This final expression matches exactly what is written in Option B. Hence, the correct answer is Option B.

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