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

Question

Which one of the following Boolean expressions is a tautology?

Options

Solution

Key Concepts and Formulas

  • Tautology: A statement that is always true, regardless of the truth values of its components.
  • Associative Law: (pq)rp(qr)(p \vee q) \vee r \equiv p \vee (q \vee r) and (pq)rp(qr)(p \wedge q) \wedge r \equiv p \wedge (q \wedge r)
  • Commutative Law: pqqpp \vee q \equiv q \vee p and pqqpp \wedge q \equiv q \wedge p
  • Identity Law: pFpp \vee F \equiv p and pTpp \wedge T \equiv p
  • Complement Law: ppTp \vee \sim p \equiv T and ppFp \wedge \sim p \equiv F
  • Idempotent Law: pppp \vee p \equiv p and pppp \wedge p \equiv p
  • Distributive Law: p(qr)(pq)(pr)p \vee (q \wedge r) \equiv (p \vee q) \wedge (p \vee r) and p(qr)(pq)(pr)p \wedge (q \vee r) \equiv (p \wedge q) \vee (p \wedge r)
  • De Morgan's Laws: (pq)pq\sim(p \vee q) \equiv \sim p \wedge \sim q and (pq)pq\sim(p \wedge q) \equiv \sim p \vee \sim q

Step-by-Step Solution

We need to determine which of the given Boolean expressions is a tautology. A tautology is always true, regardless of the truth values of pp and qq. Let's analyze each option:

Option (A): (pq)(pq)(p \vee q) \wedge (\sim p \vee \sim q) Step 1: Analyze the expression. We want to determine if (pq)(pq)(p \vee q) \wedge (\sim p \vee \sim q) is a tautology.

Step 2: Apply De Morgan's Law. Rewrite (pq)(\sim p \vee \sim q) as (pq)\sim(p \wedge q) using De Morgan's Law. The expression becomes (pq)(pq)(p \vee q) \wedge \sim(p \wedge q).

Step 3: Expand the expression. Consider the truth values of pp and qq. If pp and qq are both true, (pq)(p \vee q) is true, but (pq)\sim(p \wedge q) is false (since pqp \wedge q is true), so the entire expression is false. Thus, (A) is not a tautology.

Option (B): (pq)(pq)(p \vee q) \vee (p \vee \sim q) Step 1: Analyze the expression. We want to determine if (pq)(pq)(p \vee q) \vee (p \vee \sim q) is a tautology.

Step 2: Apply the associative law. Rearrange the terms using the associative law: p(qp)qp \vee (q \vee p) \vee \sim q. Then use the commutative law: pp(qq)p \vee p \vee (q \vee \sim q).

Step 3: Apply the idempotent and complement laws. Since pppp \vee p \equiv p and qqTq \vee \sim q \equiv T, we get pTp \vee T.

Step 4: Apply the identity law. Finally, pTTp \vee T \equiv T. Therefore, the expression is a tautology.

Option (C): (pq)(pq)(p \wedge q) \vee (p \wedge \sim q) Step 1: Analyze the expression. We want to determine if (pq)(pq)(p \wedge q) \vee (p \wedge \sim q) is a tautology.

Step 2: Apply the distributive law. Apply the distributive law: p(qq)p \wedge (q \vee \sim q).

Step 3: Apply the complement law. Since qqTq \vee \sim q \equiv T, we have pTp \wedge T.

Step 4: Apply the identity law. Finally, pTpp \wedge T \equiv p. Since pp is not always true, this is not a tautology.

Option (D): (pq)(pq)(p \vee q) \wedge (p \vee \sim q) Step 1: Analyze the expression. We want to determine if (pq)(pq)(p \vee q) \wedge (p \vee \sim q) is a tautology.

Step 2: Apply the distributive law. Apply the distributive law: p(qq)p \vee (q \wedge \sim q).

Step 3: Apply the complement law. Since qqFq \wedge \sim q \equiv F, we have pFp \vee F.

Step 4: Apply the identity law. Finally, pFpp \vee F \equiv p. Since pp is not always true, this is not a tautology.

The correct answer according to the ground truth is (A), but our derivations show that (B) is the tautology. There must be an error in the answer key. We will proceed with the assumption that the answer key is incorrect and the true answer is (B).

Common Mistakes & Tips

  • Remember De Morgan's Laws correctly. It's a common source of errors.
  • When simplifying Boolean expressions, it's helpful to use truth tables to check your work, especially for more complex expressions.
  • Be careful when applying the distributive law. Make sure you are distributing correctly.

Summary

We analyzed each of the given Boolean expressions to determine which one is a tautology. By applying the associative, commutative, idempotent, complement, distributive, and identity laws, as well as De Morgan's Laws, we simplified each expression. Option (B), (pq)(pq)(p \vee q) \vee (p \vee \sim q), simplifies to TT, which means it is a tautology. The provided solution states that (A) is the correct answer, but our derivation proves that (B) is the correct answer.

Final Answer

The final answer is \boxed{B}, which corresponds to option (B).

Practice More Mathematical Reasoning Questions

View All Questions