RankRizz
JEE MAIN 2014 · 12 APR ONLINE+4 / −1EASYTRANSCRIBED

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

Let p, q, r denote arbitrary statements. Then the logically equivalent of the statement p⇒(q∨r)p \Rightarrow (q \vee r) is:

SOLUTION

We are given the statement p⇒(q∨r)p \Rightarrow (q \vee r) and need to find which option is logically equivalent to it. Remember that a⇒ba \Rightarrow b is equivalent to ∼a∨b\sim a \vee b. So, let's rewrite the given statement:

p⇒(q∨r)=∼p∨(q∨r)p \Rightarrow (q \vee r) = \sim p \vee (q \vee r)

Since disjunction (OR) is associative, we can write this as:

∼p∨q∨r\sim p \vee q \vee r

Now, we'll check each option by converting them into equivalent forms using the same implication rule.

Option A: (p∨q)⇒r(p \vee q) \Rightarrow r

Rewrite the implication:

(p∨q)⇒r=∼(p∨q)∨r(p \vee q) \Rightarrow r = \sim (p \vee q) \vee r

Apply De Morgan's law to ∼(p∨q)\sim (p \vee q):

(∼p∧∼q)∨r(\sim p \wedge \sim q) \vee r

This is not the same as ∼p∨q∨r\sim p \vee q \vee r because it has a conjunction (∧\wedge) and different terms. For example, if pp is false, qq is false, and rr is false, the original statement is true (since ∼p\sim p is true), but this expression becomes (true∧true)∨false=true∨false=true(\text{true} \wedge \text{true}) \vee \text{false} = \text{true} \vee \text{false} = \text{true}. However, if pp is true, qq is false, and rr is false, the original is false (true implies false), but this expression is (false∧true)∨false=false∨false=false(\text{false} \wedge \text{true}) \vee \text{false} = \text{false} \vee \text{false} = \text{false}, which matches. But let's test another case: pp false, qq true, rr false. Original: false implies (true or false) = false implies true = true. Option A: (false∨true)⇒false=true⇒false=false(\text{false} \vee \text{true}) \Rightarrow \text{false} = \text{true} \Rightarrow \text{false} = \text{false}. Not the same. So, not equivalent.

Option B: (p⇒q)∨(p⇒r)(p \Rightarrow q) \vee (p \Rightarrow r)

Rewrite each implication:

p⇒q=∼p∨qp \Rightarrow q = \sim p \vee q

p⇒r=∼p∨rp \Rightarrow r = \sim p \vee r

So the expression becomes:

(∼p∨q)∨(∼p∨r)(\sim p \vee q) \vee (\sim p \vee r)

Since disjunction is associative and commutative, rearrange:

∼p∨∼p∨q∨r\sim p \vee \sim p \vee q \vee r

Simplify (∼p∨∼p=∼p\sim p \vee \sim p = \sim p):

∼p∨q∨r\sim p \vee q \vee r

This matches the original expression exactly. So, option B is equivalent.

Option C: (p⇒∼q)∧(p⇒r)(p \Rightarrow \sim q) \wedge (p \Rightarrow r)

Rewrite each implication:

p⇒∼q=∼p∨∼qp \Rightarrow \sim q = \sim p \vee \sim q

p⇒r=∼p∨rp \Rightarrow r = \sim p \vee r

So the expression is:

(∼p∨∼q)∧(∼p∨r)(\sim p \vee \sim q) \wedge (\sim p \vee r)

Factor out ∼p\sim p using distribution:

∼p∨(∼q∧r)\sim p \vee (\sim q \wedge r)

This is not the same as ∼p∨q∨r\sim p \vee q \vee r. For example, if pp is true, qq is true, and rr is false, the original statement is true (true implies (true or false) = true implies true = true), but this expression is false∨(false∧false)=false∨false=false\text{false} \vee (\text{false} \wedge \text{false}) = \text{false} \vee \text{false} = \text{false}. Not equivalent.

Option D: (p⇒q)∧(p⇒∼r)(p \Rightarrow q) \wedge (p \Rightarrow \sim r)

Rewrite each implication:

p⇒q=∼p∨qp \Rightarrow q = \sim p \vee q

p⇒∼r=∼p∨∼rp \Rightarrow \sim r = \sim p \vee \sim r

So the expression is:

(∼p∨q)∧(∼p∨∼r)(\sim p \vee q) \wedge (\sim p \vee \sim r)

Factor out ∼p\sim p:

∼p∨(q∧∼r)\sim p \vee (q \wedge \sim r)

This is not the same as ∼p∨q∨r\sim p \vee q \vee r. For example, if pp is true, qq is false, and rr is true, the original statement is true (true implies (false or true) = true implies true = true), but this expression is false∨(false∧false)=false∨false=false\text{false} \vee (\text{false} \wedge \text{false}) = \text{false} \vee \text{false} = \text{false}. Not equivalent.

Therefore, only option B is logically equivalent to the given statement. 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