Topper Copies

Obtain OR gate by the use of NAND Gate? Is it even possible?

Aryan Yadav, AIR 31, 2025

NAND is universal gate => Possible

$A$ NAND $1 = \bar{A}$

$\bar{A}$ NAND $\bar{B}$ $= A + B = A$ OR $B$

(If 1 not and we can use $[?]$ $A$ NAND $A = \bar{A}$ )