How do I simplify:
a'bc'+b'c'
Mathematica code
Wolfram linkCode:BooleanMinimize[! a && b && ! c || ! b && ! c]
Answer should be:
a'c' + b'c'
How do I simplify:
a'bc'+b'c'
Mathematica code
Wolfram linkCode:BooleanMinimize[! a && b && ! c || ! b && ! c]
Answer should be:
a'c' + b'c'
Take c' as a common factor
c'(a'b + b')
then as Walagaster said, a'b + b' = a' + b' (if you have a variable alone with OR, all its complement will be gone!)
c'(a'b + b') = c'(a' + b') = c'a' + c'b'
That was one way to solve the equation. Another method is that you can use a k-map
I hope that you are familiar of how to use the k-map
According to this simple k-map, all you have to do is to collect each two 1's together.