Q.State and prove De-Morgan's theorems.
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 →De Morgan's two theorems relate the complement of OR/AND combinations to AND/OR combinations of the individual complements, proved by truth table and gate equivalence.
Statement
First theorem: The complement of the sum (OR) of two variables equals the product (AND) of their individual complements:
Second theorem: The complement of the product (AND) of two variables equals the sum (OR) of their individual complements:
Proof of the first theorem by truth table
| 0 | 0 | 0 | 1 | 1 | 1 | 1 |
| 0 | 1 | 1 | 0 | 1 | 0 | 0 |
| 1 | 0 | 1 | 0 | 0 | 1 | 0 |
| 1 | 1 | 1 | 0 | 0 | 0 | 0 |
The columns for and are identical for all four input combinations, so is proved. This theorem shows that a NOR gate (OR followed by NOT) is logically equivalent to a bubbled AND gate — an AND gate with both inputs inverted.
Proof of the second theorem by truth table
| 0 | 0 | 0 | 1 | 1 | 1 | 1 |
| 0 | 1 | 0 | 1 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 | 0 | 1 | 1 |
| 1 | 1 | 1 | 0 | 0 | 0 | 0 |
| … |
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.