0 votes 0 votes Minimum number of NAND Gates for the functions F = AC’ + ACE + ACE’ + A’CD’ + A’D’E’ F = (B’ + D’)(A’+C’+D)(A+B’+C’+D)(A’+B+C’+D’) Digital Logic digital-logic nand + – Na462 asked Mar 5, 2019 • edited Mar 5, 2019 by Na462 Na462 3.0k views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Na462 commented Mar 7, 2019 reply Follow Share Assuming complements aren't given and default case by taking fan in as u please 1 votes 1 votes Prasun786 commented Jun 22, 2019 reply Follow Share How did you minimize the first one? I am not able to follow up with @Na462's solution from step 3. I can only minimize till F = A+A'CD'+A'D'E' 1 votes 1 votes Sabirazain commented Apr 25, 2020 reply Follow Share There is a rule A+A'B = A+B A+A'CD'+A'D'E'. Here we can write it as A+A'(CD'+D'E'). So A+CD'+D'E' 1 votes 1 votes Please log in or register to add a comment.