Search code examples
booleanboolean-logicalgebra

Boolean algebra simplification

I need to reduce this boolean expression to its simplest form. Its given that the simplest form contains 3 terms and 7 literals.

The expression is:

x'yz + w'x'z + x'y + wxy + w'y'z

We tried this in class, and even our recitation teacher could not figure it out.

Any help would be appreciated.

Solution

  • I'm a bit rusty with boolean algebra, but I think I've worked out how to do this. I'll let you do the working, but here are the basic steps:

    1) Group the terms with y and eliminate what you can inside the brackets. Once expanded again, this will leave you with four terms and ten literals.

    2) Eliminate the redundant term, leaving you with three terms and seven literals.

    Hint: I first worked out the answer with a Karnaugh map, and then used regular boolean algebra to get to the solution :-)