# use minimum number of NAND gates to realize this boolean expression [closed]

How should I proceed to find the minimum number of 2 input NAND gates to realize this boolean expression. I am allowed to use both complemented and non-complemented inputs.

$$F = X.Y + Y.Z + \overline{X}.\overline{Y}.\overline{Z}$$

• Welcome to EE.SE! This looks like a homework assignment. Please show what you have tried to far. Aug 25 '19 at 10:46
• Homework questions with no attempt at a solution are closed. Aug 25 '19 at 12:26
• Hint; De-morgans theorem Aug 26 '19 at 10:29
• @LeonHeller I had just asked for some hint on how to proceed with the problem as I have no clue on how to prove that any solution I arrive at is the optimal solution. I did not ask you to solve the problem for me. Aug 27 '19 at 15:55
• Mitu gave you a great hint. Edit your question showing some effort. We are willing to help, but you have to try. We do not do the heavy lifting. Aug 28 '19 at 0:00