RankRizz
JEE MAIN 2018 · 15 APR S1+4 / −1EASYTRANSCRIBED

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

If (p∧∼q)∧(p∧r)→∼p∨q(p \wedge \sim q) \wedge (p \wedge r) \rightarrow \sim p \vee q is false, then the truth values of p, q and r are respectively:

SOLUTION

We are given the compound statement ((p∧∼q)∧(p∧r))  →  (∼p ∨ q)\bigl((p \wedge \sim q) \wedge (p \wedge r)\bigr)\;\rightarrow\;(\sim p \,\vee\, q) and we are told that this entire implication is false.

First, recall the fundamental truth-table rule for an implication:

A→BA \rightarrow B is false exactly when AA is true and BB is false.

Applying this rule, let us denote

A=(p∧∼q)∧(p∧r),B=∼p ∨ q.A = (p \wedge \sim q) \wedge (p \wedge r), \qquad B = \sim p \,\vee\, q.

Because the whole implication is false, we must have

A is trueandB is false.A \text{ is true} \quad\text{and}\quad B \text{ is false.}

We analyse these two conditions one after another.

Condition 1: antecedent AA is true.

Write AA more clearly:

A=(p∧∼q)∧(p∧r).A = (p \wedge \sim q) \wedge (p \wedge r).

For a conjunction to be true, every part must be true. So we need

p∧∼q is trueandp∧r is true.p \wedge \sim q \text{ is true} \quad\text{and}\quad p \wedge r \text{ is true.}

Each of these is itself a conjunction, so we split further:

• From p∧∼qp \wedge \sim q being true we get

p is trueand∼q is true.p \text{ is true} \quad\text{and}\quad \sim q \text{ is true.}

• From p∧rp \wedge r being true we get

p is trueandr is true.p \text{ is true} \quad\text{and}\quad r \text{ is true.}

Combining all these sub-conditions we have so far

p=T,∼q=T,r=T.p = \text{T}, \quad \sim q = \text{T}, \quad r = \text{T}.

The statement ∼q=T\sim q = \text{T} immediately gives

q=F.q = \text{F}.

Condition 2: consequent BB is false.

Now look at

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

For a disjunction X∨YX \vee Y to be false, both XX and YY must be false. Therefore

∼p=Fandq=F.\sim p = \text{F} \quad\text{and}\quad q = \text{F}.

We already have q=Fq = \text{F} from the first condition, so that part is consistent. The requirement ∼p=F\sim p = \text{F} means

p=T,p = \text{T},

which also matches what we obtained earlier. Thus both conditions are satisfied simultaneously by exactly one set of truth values:

p=T,q=F,r=T.p = \text{T}, \quad q = \text{F}, \quad r = \text{T}.

These correspond to the option <T, F, T>.

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