RankRizz
JEE MAIN 2019 · 11 JAN S1+4 / −1MEDIUMTRANSCRIBED

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

If q is false and p∧q↔rp \wedge q \leftrightarrow r is true, then which one of the following statements is a tautology?

SOLUTION

We are told that the statement qq is false and at the same time the biconditional (p∧q)↔r(p \wedge q) \leftrightarrow r is true. Let us first interpret this information.

By definition, the conjunction p∧qp \wedge q is true only when both pp and qq are true. Because we already know that qq is false, the value of the entire conjunction is immediately fixed:

p∧q=False.p \wedge q = \text{False}.

Next, we look at the biconditional. Remember the rule for a biconditional:

For any two statements AA and BB, the statement A↔BA \leftrightarrow B is true precisely when either
(i) both AA and BB are true, or
(ii) both AA and BB are false.

In our problem A=(p∧q)A = (p \wedge q) and B=rB = r. We have discovered that AA is false. For the biconditional A↔BA \leftrightarrow B to be true, case (ii) must hold; therefore BB must also be false. Concretely,

r=False.r = \text{False}.

At this point we have

q=False,r=False,pq = \text{False}, \quad r = \text{False}, \quad p is still free (it can be True or False).

We now inspect each option to see which statement is necessarily true—i.e. a tautology—under these fixed truth values.

Option A: (p∨r)→(p∧r).(p \vee r) \to (p \wedge r).
Because r=False,r = \text{False}, we simplify step by step:

p∨r=p∨False=p,p \vee r = p \vee \text{False} = p,
p∧r=p∧False=False.p \wedge r = p \wedge \text{False} = \text{False}.

Thus Option A becomes p→False.p \to \text{False}. The truth rule for implication says A→BA \to B is false exactly when AA is true and BB is false. Here, whenever pp is true the implication is false. Hence Option A is not always true.

Option B: (p∧r)→(p∨r).(p \wedge r) \to (p \vee r).
Again using r=Falser = \text{False} we get

p∧r=p∧False=False,p \wedge r = p \wedge \text{False} = \text{False},
p∨r=p∨False=p.p \vee r = p \vee \text{False} = p.

The whole statement reduces to False→p.\text{False} \to p. An implication whose antecedent is false is always true, irrespective of the consequent. Therefore Option B is always true for both possibilities of pp and is thus a tautology.

Option C: p∧r=p∧False=False.p \wedge r = p \wedge \text{False} = \text{False}. This is always false, so it certainly is not a tautology.

Option D: p∨r=p∨False=p.p \vee r = p \vee \text{False} = p. The truth of this statement depends on whether pp itself is true or false, so it is not guaranteed to be true in all cases.

Only Option B satisfies the requirement of being always true under the given conditions.

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