Question
Without using truth table prove that : (p ∧ q) ∨ (~ p ∧ q) ∨ (p ∧ ~q) ≡ p ∨ q

Answer

LHS = (p ∧ q) v (~p ∧ q) ∨ (p ∧ ~q)
≡ [(p ∨ ~p) ∧ q] ∨ (p ∧ ~q) … (Distributive Law)
≡ (T ∧ q) ∨ (p ∧ ~q) … (Complement Law)
≡ q ∨ (p ∧ ~q) … (Identity Law)
≡ (q ∨ p) ∧ (q ∨ ~q) … (Distributive Law)
≡ (q ∨ p) ∧ T .. (Complement Law)
≡ q ∨ p … (Identity Law)
≡ p ∨ q … (Commutative Law)
≡ RHS.

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free