Skip to main content
Back to Mathematical Reasoning
JEE Main 2021
Mathematical Reasoning
Mathematical Reasoning
Easy

Question

The statement ((pq))q(\sim(\mathrm{p} \Leftrightarrow \,\sim \mathrm{q})) \wedge \mathrm{q} is :

Options

Solution

Key Concepts and Formulas

  • Logical Equivalence: Two statements are logically equivalent if they have the same truth values in all possible cases.
  • Biconditional (p ⇔ q): True when both p and q have the same truth value (both true or both false).
  • Conditional (p ⇒ q): False only when p is true and q is false; otherwise, it's true. Equivalent to ¬p ∨ q.
  • Negation (¬p): Reverses the truth value of p.
  • Conjunction (p ∧ q): True only when both p and q are true.
  • De Morgan's Laws:
    • ¬(p ∧ q) ≡ ¬p ∨ ¬q
    • ¬(p ∨ q) ≡ ¬p ∧ ¬q

Step-by-Step Solution

Step 1: Simplify the expression using the equivalence of the biconditional

We start with the given expression: ((pq))q(\sim(\mathrm{p} \Leftrightarrow \,\sim \mathrm{q})) \wedge \mathrm{q}. We know that pq(pq)(qp)p \Leftrightarrow q \equiv (p \rightarrow q) \wedge (q \rightarrow p). Therefore, pq(pq)(qp)p \Leftrightarrow \sim q \equiv (p \rightarrow \sim q) \wedge (\sim q \rightarrow p). Then, (pq)((pq)(qp))\sim(p \Leftrightarrow \sim q) \equiv \sim((p \rightarrow \sim q) \wedge (\sim q \rightarrow p)).

Applying De Morgan's Law: ((pq)(qp))(pq)(qp)\sim((p \rightarrow \sim q) \wedge (\sim q \rightarrow p)) \equiv \sim(p \rightarrow \sim q) \vee \sim(\sim q \rightarrow p)

Step 2: Convert conditionals to disjunctions

We know that pqpqp \rightarrow q \equiv \sim p \vee q. So, pqpqp \rightarrow \sim q \equiv \sim p \vee \sim q and qp(q)pqp\sim q \rightarrow p \equiv \sim(\sim q) \vee p \equiv q \vee p.

Substituting these into the expression from Step 1:

(pq)(qp)\sim(\sim p \vee \sim q) \vee \sim(q \vee p)

Applying De Morgan's Law again:

(pq)(qp)(p \wedge q) \vee (\sim q \wedge \sim p)

Step 3: Combine with the conjunction

Now we combine this with the 'q' from the original expression using conjunction:

((pq)(qp))q((p \wedge q) \vee (\sim q \wedge \sim p)) \wedge q

Distributing the 'q':

(pqq)(qpq)(p \wedge q \wedge q) \vee (\sim q \wedge \sim p \wedge q)

Since qqqq \wedge q \equiv q and qqFq \wedge \sim q \equiv F (False), we have:

(pq)(Fp)(p \wedge q) \vee (F \wedge \sim p)

Since anything AND False is False:

(pq)F(p \wedge q) \vee F

Which simplifies to:

pqp \wedge q

Step 4: Show equivalence to (p ⇒ q) ∧ p

We want to show that pqp \wedge q is equivalent to (pq)p(p \Rightarrow q) \wedge p.

(pq)p(pq)p(p \Rightarrow q) \wedge p \equiv (\sim p \vee q) \wedge p

Distributing the 'p':

(pp)(qp)(\sim p \wedge p) \vee (q \wedge p)

Since ppF\sim p \wedge p \equiv F:

F(qp)F \vee (q \wedge p)

Which simplifies to:

pqp \wedge q

Therefore, ((pq))q(\sim(\mathrm{p} \Leftrightarrow \,\sim \mathrm{q})) \wedge \mathrm{q} is equivalent to (pq)p(p \Rightarrow q) \wedge p.

Step 5: Construct the truth table for (p ⇒ q) ∧ p

pqp ⇒ q(p ⇒ q) ∧ p
TTTT
TFFF
FTTF
FFTF

Step 6: Re-examine the options

Since the expression simplifies to pqp \wedge q, let's re-evaluate the options. The truth table above matches the truth table of pqp \wedge q.

  • (A) a tautology: A tautology is always true, but pqp \wedge q is not always true. So, it's not a tautology.
  • (B) a contradiction: A contradiction is always false, but pqp \wedge q is not always false. So, it's not a contradiction.
  • (C) equivalent to (pq)q(p \Rightarrow q) \wedge q: (pq)q(¬pq)q(¬pq)(qq)(¬pq)qq(p \Rightarrow q) \wedge q \equiv (\neg p \vee q) \wedge q \equiv (\neg p \wedge q) \vee (q \wedge q) \equiv (\neg p \wedge q) \vee q \equiv q. This is not equivalent to pqp \wedge q.
  • (D) equivalent to (pq)p(p \Rightarrow q) \wedge p: As shown in step 4, (pq)ppq(p \Rightarrow q) \wedge p \equiv p \wedge q. This is equivalent to pqp \wedge q.

Therefore the correct answer is (D).

Common Mistakes & Tips

  • Carefully apply De Morgan's laws. Double-check the negations.
  • Remember the equivalence of pqp \Rightarrow q with pq\sim p \vee q. This is crucial for simplification.
  • When simplifying, always look for opportunities to use the properties of logical connectives (e.g., pppp \wedge p \equiv p, pppp \vee p \equiv p, pFFp \wedge F \equiv F, pTTp \vee T \equiv T).

Summary

We started with the expression ((pq))q(\sim(\mathrm{p} \Leftrightarrow \,\sim \mathrm{q})) \wedge \mathrm{q}, used the equivalence of biconditional, De Morgan's Laws, and the conditional statement to simplify the expression to pqp \wedge q. We then showed that pqp \wedge q is equivalent to (pq)p(p \Rightarrow q) \wedge p. This corresponds to option (D).

Final Answer

The final answer is \boxed{(p \Rightarrow q) \wedge p}, which corresponds to option (D).

Practice More Mathematical Reasoning Questions

View All Questions