[Math] Simplify boolean expression to minimum number of literals

Question

Problem is to simplify this boolean expression:

$(a+b+c')(a'b'+c)$

I expanded it out and simplified to get to $a'b'c' + c(a+b)$ but that doesn't reduce the number of literals. Tried everything I could think of but I must be missing something…

Answer 1

How is this?

Found using Logic Friday 1.