Using boolean manipulation, how could I prove these two sides are equal? For number one, I was considering manipulating both sides until they match. I can't seem to manipulate it correctly though.
1. wy + w'yz' + wxz + w'xy' = wy + w'xz' + x'yz' + xy'z
2. ad' + a'b + c'd + b'c = (a' + b' + c' + d')(a + b + c + d)
The notation I'm using is: ( ' = NOT ) ( + = OR ) ( * or multiplication = AND )
Here is a link to the basic boolean manipulation rules: Boolean Algebra Laws
Thanks for any help or input!
1. wy + w'yz' + wxz + w'xy' = wy + w'xz' + x'yz' + xy'z
2. ad' + a'b + c'd + b'c = (a' + b' + c' + d')(a + b + c + d)
The notation I'm using is: ( ' = NOT ) ( + = OR ) ( * or multiplication = AND )
Here is a link to the basic boolean manipulation rules: Boolean Algebra Laws
Thanks for any help or input!
Last edited: