One Gate to Rule Them All

NAND is universal

An interactive lesson with 6 steps, about 5 minutes: you predict, drag and solve, with instant feedback on every answer. It runs in your browser and needs JavaScript.

What you’ll learn

• NAND = NOT AND. NAND with both inputs tied together is NOT.
• De Morgan: NOT(A AND B) = NOT A OR NOT B, and NOT(A OR B) = NOT A AND NOT B.
• NAND alone can build any logic circuit.

Steps

1. NAND
2. NOT from NAND
3. AND from NANDs
4. De Morgan’s laws
5. XOR from NAND
6. OR from NANDs