RankRizz
JEE MAIN 2017 · 08 APR ONLINE+4 / −1EASYTRANSCRIBED

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

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

SOLUTION

We begin with the given compound proposition

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

Our goal is to simplify it step by step, using the standard Boolean algebra (logical algebra) identities. The symbols have their usual meanings: ∼\sim denotes negation, ∨\vee denotes disjunction (OR), and ∧\wedge denotes conjunction (AND).

First, we recall the distributive law of logic, stated as

A  ∨  (B∧C)  ≡  (A∨B)  ∧  (A∨C).A \;\vee\; (B \wedge C) \;\equiv\; (A \vee B)\; \wedge\; (A \vee C).

Here we can identify A=∼p,A = \sim p, B=p,B = p, and C=∼q.C = \sim q. Substituting these into the distributive law, we obtain

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

Next, notice that the expression ∼p ∨ p\sim p \,\vee\, p is a tautology because a statement OR its negation is always true. Symbolically,

∼p ∨ p  ≡  True.\sim p \,\vee\, p \;\equiv\; \text{True}.

When we have a conjunction in which one of the factors is the tautology, the whole conjunction reduces to the other factor. That is, True∧X≡X.\text{True} \wedge X \equiv X. Therefore,

(∼p ∨ p)  ∧  (∼p ∨ ∼q)  ≡  True∧(∼p ∨ ∼q)  ≡  (∼p ∨ ∼q).(\sim p \,\vee\, p)\; \wedge\; (\sim p \,\vee\, \sim q) \;\equiv\; \text{True} \wedge (\sim p \,\vee\, \sim q) \;\equiv\; (\sim p \,\vee\, \sim q).

So we have shown

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

Now we recognize another standard logical equivalence: the implication form. The implication

p→∼qp \to \sim q

is, by definition, equivalent to the disjunction

∼p ∨ ∼q.\sim p \,\vee\, \sim q.

Since we have just derived the very same disjunction, it follows directly that

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

Thus, the original proposition is logically equivalent to the implication p→∼q,p \to \sim q, which corresponds to Option A.

Hence, the correct answer 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