Skip to content
Question 212 of 227

Q.Without using truth table prove that (p∧q)∨(∼p∧q)∨(p∧∼q)≡p∨q(p \wedge q) \vee (\sim p \wedge q) \vee (p \wedge \sim q) \equiv p \vee q

Maharashtra MsbshseMaharashtra HSC (MSBSHSE) Board 2022Subjective· 4mImportance★★★★★
93% · 212/227 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

Group the first two terms to factor out qq, then simplify using p∨∼p≡Tp\vee\sim p\equiv T.

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

Group the first two terms (both contain qq):

=[q∧(p∨∼p)]∨(p∧∼q)= [q\wedge(p\vee\sim p)]\vee(p\wedge\sim q)

=[q∧T]∨(p∧∼q)(since p∨∼p≡T)= [q\wedge T]\vee(p\wedge\sim q) \qquad (\text{since } p\vee\sim p\equiv T)

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

…

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.