Hello all,
I'm a freshman electrical engineer in a digital logic class (I'll be here a lot this semester!) and I'm stuck on a homework problem involving Boolean equations.
The question asks me to prove this equation using algebraic manipulation:
WY + W'YZ' + WXZ + W'XY' = WY + W'XZ' + X'YZ' XY'Z
I figured it out using expansion but is there any way of approaching problems like this (where identities aren't immediately obvious) from a purely algebraic standpoint? Or is expansion into minterms the simplest way?
Cheers,
Ben
I'm a freshman electrical engineer in a digital logic class (I'll be here a lot this semester!) and I'm stuck on a homework problem involving Boolean equations.
The question asks me to prove this equation using algebraic manipulation:
WY + W'YZ' + WXZ + W'XY' = WY + W'XZ' + X'YZ' XY'Z
I figured it out using expansion but is there any way of approaching problems like this (where identities aren't immediately obvious) from a purely algebraic standpoint? Or is expansion into minterms the simplest way?
Cheers,
Ben