# simplify/rewrite the expression so it can be implemented with a maximum of 11 two input-NAND Gates

#### omaralnoman

Joined Nov 10, 2017
2
X = AC'D'E' + ABC + A'D'E + CE + CD

Note : All inputs are available in both complement and uncomplemented forms.

I tried to simplify it many times but I almost always end up with 12 gates or more.
Here is What I got:
(C+D') [(C'+AB)(C+AE') + E(C+A')] + CD

Last edited:

#### WBahn

Joined Mar 31, 2012
29,513
X = AC'D'E' + ABC + A'D'E + CE + CD

Note : All inputs are available in both complement and uncomplemented forms.

I tried to simplify it many times but I almost always end up with 12 gates or more.
Here is What I got:
(C+D') [(C'+AB)(C+AE') + E(C+A')] + CD
I don't see any NAND gates in that expression.

Have you tried using a K-map on it?

#### WBahn

Joined Mar 31, 2012
29,513
MOD NOTE: Moved to Homework Help.

#### omaralnoman

Joined Nov 10, 2017
2
I don't see any NAND gates in that expression.

Have you tried using a K-map on it?
NAND Gate is a universal gate.... you can implement any circuit by using only nand gates.
for example (C+D') is obviously an OR gate but you can use NAND GATE since nand is equivalent to negative OR
C'---
NAND Gate -----
D---

#### WBahn

Joined Mar 31, 2012
29,513