1. The problem statement, all variables and given/known data Simplify the following Boolean expressions to a minimum number of literals (a+b+c')(a'b'+c) 2. The attempt at a solution Whenever I tried this I made no progress in reducing the number of literals, I just reordered the expression. (a+b+c')(a'b'+c) =aa'b'+a'bb'+a'b'c'+ac+bc+cc' =0b'+a'0+a'b'c'+ac+bc+0 =0+0+a'+b'+c'+ac+bc+0 =a'b'c'+ac+bc =a'b'c'+c(a+b) I began with 6 literals and ended with 6. What else can I try?