RankRizz
JEE MAIN 2015 · 11 APR ONLINE+4 / −1MEDIUMTRANSCRIBED

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

Consider the following statements:
P: Suman is brilliant
Q: Suman is rich
R: Suman is honest

The negation of the statement, "Suman is brilliant and dishonest if and only if Suman is rich" can be equivalently expressed as

SOLUTION

We are given three statements:

  • P: Suman is brilliant
  • Q: Suman is rich
  • R: Suman is honest

The statement to negate is: "Suman is brilliant and dishonest if and only if Suman is rich".

First, note that "dishonest" means not honest, so it is represented as ∼R\sim R. Therefore, "Suman is brilliant and dishonest" is written as P∧∼RP \wedge \sim R.

The entire statement "Suman is brilliant and dishonest if and only if Suman is rich" is logically expressed as (P∧∼R)↔Q(P \wedge \sim R) \leftrightarrow Q.

We need to find the negation of this statement: ∼[(P∧∼R)↔Q]\sim \left[ (P \wedge \sim R) \leftrightarrow Q \right].

Recall that the negation of a biconditional A↔BA \leftrightarrow B is equivalent to A↔∼BA \leftrightarrow \sim B. Applying this here, let A=P∧∼RA = P \wedge \sim R and B=QB = Q. Then:

∼[(P∧∼R)↔Q]≡(P∧∼R)↔∼Q\sim \left[ (P \wedge \sim R) \leftrightarrow Q \right] \equiv (P \wedge \sim R) \leftrightarrow \sim Q

Since the biconditional is commutative (i.e., X↔YX \leftrightarrow Y is the same as Y↔XY \leftrightarrow X), we can rewrite this as:

∼Q↔(P∧∼R)\sim Q \leftrightarrow (P \wedge \sim R)

Now, comparing this with the given options:

  • Option A: ∼Q↔∼P∨R\sim Q \leftrightarrow \sim P \vee R
  • Option B: ∼Q↔P∨∼R\sim Q \leftrightarrow P \vee \sim R
  • Option C: ∼Q↔P∧∼R\sim Q \leftrightarrow P \wedge \sim R
  • Option D: ∼Q↔∼P∧R\sim Q \leftrightarrow \sim P \wedge R

Our expression ∼Q↔(P∧∼R)\sim Q \leftrightarrow (P \wedge \sim R) matches Option C exactly.

Therefore, the negation of the given statement is equivalently expressed as Option C.

Hence, the correct answer is Option C.

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