Simplifying Boolean Algebra Expressions with K-maps

[mattskie]

Homework Statement

Show that F=wy'z+x'y'z+w'xy+wx'y+wxy = y'z+yw+yx

Homework Equations

Boolean Algebra..

The Attempt at a Solution

F=y'z(x+x') + yw(x+x') + w'xy
=> y'z+yw+w'xy
=> y'z + y(w+w'x)
=> y'z + y + yw <-----stuck here what do i do? Not sure if this step is right either...

 

[berkeman]

Homework Statement

Show that F=wy'z+x'y'z+w'xy+wx'y+wxy = y'z+yw+yx

Homework Equations

Boolean Algebra..

The Attempt at a Solution

F=y'z(x+x') + yw(x+x') + w'xy
=> y'z+yw+w'xy
=> y'z + y(w+w'x)
=> y'z + y + yw <-----stuck here what do i do? Not sure if this step is right either...

Have you tried first showing it via a K-map? I often find it useful to start with a K-map simplification to help me with the logical manipulations...