1. The problem statement, all variables and given/known data Hey PF! I'm supposed to "Optimize the equation for minimal input-output delay with 3-input NAND gates of 1.8ns delay each." It'll become much clearer at my attempt at a solution, I hope. 2. Relevant equations De Morgan's laws, K-maps, the sort... 3. The attempt at a solution So this is part of a homework assignment I've been struggling with for a while now. We were given a word problem and had to simplify it using three input NAND gates. I've simplified the actual word problem to : F(ABCD)= AB + CD + BD + BC + AD + AC As you can see this doesn't use any NAND gates, so I simplified it further to: (A NAND B) NAND (A NAND C) NAND (A NAND D) NAND (B NAND C) NAND (B NAND D) NAND (C NAND D) Sorry for typing out the NANDS, I thought it would be easier to see than those pesky ' marks. How do I go about simplifying this further to 3 INPUT NANDS? I appreciate any guidance!