- #1
hholzer
- 37
- 0
Wasn't sure of where the most appropriate place would be for this post.
If you have a truth table, say for inclusive OR, then you get a
sums-of-products expression:
(A * B^c) + (A^c * B) + (A * B)
From this, how could I arrive at the following:
A + B = ((A + B)^c)^c = (A^c * B^c)^c
Then, we can say A + B is equivalent to:
(A NAND A) NAND (B NAND B)
Hence, we can write inclusive OR in terms of
three NANDS. In short: how can I equate
(A * B^c) + (A^c * B) + (A * B) to
(A^c * B^c)^c
I've played around with it a bit but I'm not
hitting upon anything.
If you have a truth table, say for inclusive OR, then you get a
sums-of-products expression:
(A * B^c) + (A^c * B) + (A * B)
From this, how could I arrive at the following:
A + B = ((A + B)^c)^c = (A^c * B^c)^c
Then, we can say A + B is equivalent to:
(A NAND A) NAND (B NAND B)
Hence, we can write inclusive OR in terms of
three NANDS. In short: how can I equate
(A * B^c) + (A^c * B) + (A * B) to
(A^c * B^c)^c
I've played around with it a bit but I'm not
hitting upon anything.