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

Question

Which of the following statement is a tautology?

Options

Solution

Key Concepts and Formulas

  • Tautology: A statement that is always true, regardless of the truth values of its components.
  • Contradiction: A statement that is always false, regardless of the truth values of its components.
  • Identity Laws:
    • pTTp \vee T \equiv T (where T is a tautology)
    • pFFp \wedge F \equiv F (where F is a contradiction)
  • Complement Laws:
    • ppTp \vee \sim p \equiv T
    • ppFp \wedge \sim p \equiv F

Step-by-Step Solution

We need to determine which of the given options is a tautology. Let's analyze each option:

Option (A): ((q)p)q(( \sim q) \wedge p) \wedge q

Step 1: Simplify the expression using the associative property.

  • What: Rearrange the terms using the associative property of conjunction.
  • Why: To group terms that might simplify using other logical equivalences.
  • Math: ((q)p)q(q)(pq)(( \sim q) \wedge p) \wedge q \equiv ( \sim q) \wedge (p \wedge q)

Step 2: Rearrange the terms using the commutative property.

  • What: Rearrange the terms using the commutative property of conjunction.
  • Why: To group qq and q\sim q together, which might lead to a simplification.
  • Math: (q)(pq)(q)(qp)(qq)p( \sim q) \wedge (p \wedge q) \equiv ( \sim q) \wedge (q \wedge p) \equiv (\sim q \wedge q) \wedge p

Step 3: Apply the complement law.

  • What: Simplify qq\sim q \wedge q.
  • Why: To simplify the expression further.
  • Math: (qq)pFpF(\sim q \wedge q) \wedge p \equiv F \wedge p \equiv F, where F is a contradiction.

Since option (A) simplifies to a contradiction, it is not a tautology.

Option (B): ((q)p)(p(p))(( \sim q) \wedge p) \wedge (p \wedge ( \sim p))

Step 1: Simplify the expression within the second parenthesis using the complement law.

  • What: Simplify ppp \wedge \sim p.
  • Why: To simplify the expression further.
  • Math: ((q)p)(p(p))((q)p)F(( \sim q) \wedge p) \wedge (p \wedge ( \sim p)) \equiv (( \sim q) \wedge p) \wedge F, where F is a contradiction.

Step 2: Simplify using the identity law.

  • What: Simplify the entire expression using the identity law for conjunction with a contradiction.
  • Why: To determine if the expression is a tautology.
  • Math: ((q)p)FF(( \sim q) \wedge p) \wedge F \equiv F

Since option (B) simplifies to a contradiction, it is not a tautology.

Option (C): ((q)p)(p(p))(( \sim q) \wedge p) \vee (p \vee ( \sim p))

Step 1: Simplify the expression within the second parenthesis using the complement law.

  • What: Simplify ppp \vee \sim p.
  • Why: To simplify the expression further.
  • Math: ((q)p)(p(p))((q)p)T(( \sim q) \wedge p) \vee (p \vee ( \sim p)) \equiv (( \sim q) \wedge p) \vee T, where T is a tautology.

Step 2: Simplify using the identity law.

  • What: Simplify the entire expression using the identity law for disjunction with a tautology.
  • Why: To determine if the expression is a tautology.
  • Math: ((q)p)TT(( \sim q) \wedge p) \vee T \equiv T

Since option (C) simplifies to a tautology, it is the correct answer.

Option (D): (pq)(pq)(p \wedge q) \wedge ( \sim p \wedge q)

Step 1: Rearrange terms using the associative and commutative properties.

  • What: Rearrange the terms.
  • Why: To group pp and p\sim p together.
  • Math: (pq)(pq)pqpqppqq(p \wedge q) \wedge ( \sim p \wedge q) \equiv p \wedge q \wedge \sim p \wedge q \equiv p \wedge \sim p \wedge q \wedge q

Step 2: Apply the complement law.

  • What: Simplify ppp \wedge \sim p.
  • Why: To simplify the expression further.
  • Math: ppqqFqqFqp \wedge \sim p \wedge q \wedge q \equiv F \wedge q \wedge q \equiv F \wedge q

Step 3: Apply the identity law.

  • What: Simplify FqF \wedge q.
  • Why: To determine if the expression is a tautology.
  • Math: FqFF \wedge q \equiv F

Since option (D) simplifies to a contradiction, it is not a tautology.

Common Mistakes & Tips

  • Remember the difference between conjunction (\wedge) and disjunction (\vee).
  • Be careful when applying De Morgan's Laws.
  • Recognize tautologies and contradictions quickly to simplify expressions.

Summary

We analyzed each option to determine if it simplifies to a tautology (a statement that is always true). Options (A), (B), and (D) simplified to contradictions, while option (C) simplified to a tautology. Therefore, option (C) is the correct answer.

Final Answer

The final answer is \boxed{(( \sim q) \wedge p) \vee (p \vee ( \sim p))}, which corresponds to option (C).

Practice More Mathematical Reasoning Questions

View All Questions