Simplifying boolean algebra

Thread Starter

Ramiel

Joined Feb 19, 2018
65
Hi guys I have a digital design hw with this question.

Simplify F = w’x (z’ + y’z) + x (w + w’yz) in POS using algebraic manipulations

I know how to simplify this equation normally and the answer would be equal to x

But I do not understand how am i supposed to simplify it in pos(product of sum)

Open this link and see how I regularly simplified it normally but how do I do it in pos

https://ibb.co/fRxsnx
 

WBahn

Joined Mar 31, 2012
24,987
Your linked image isn't showing. Please upload your files to AAC so that they can be properly archived with the site.
 

WBahn

Joined Mar 31, 2012
24,987
Other than a typo in your third line, I don't see a problem.

You might want to be more explicit in your second two simplifications (like you were in the first).

I don't know what they mean by "simplify in POS". I think what you did is reasonable in that you first expressed it in POS.
 

Thread Starter

Ramiel

Joined Feb 19, 2018
65
Other than a typo in your third line, I don't see a problem.

You might want to be more explicit in your second two simplifications (like you were in the first).

I don't know what they mean by "simplify in POS". I think what you did is reasonable in that you first expressed it in POS.
Yeah I am only confused about the part “ in pos” like is there a way to simplify in product of sum or sum of products or is it just regular simplification like I did.
 
Top