Boolean Algebra (POS Expression)

Thread Starter

Shamieh

Joined Oct 24, 2013
36
Use algebraic manipulation to find the minimum product of-sums expression for the function:(A + C + D) (A + B! + C)(A + B! + C! + D)

What am I doing wrong??

Here is what I have so far...

1) I need each expression to have all of the terms.
2) so I said okay the first term is missing a B, and the second term is missing a D so I did...

(A + B + C + D)(A + B! + C + D!)(A + B! + C + D)(A + B! + C + D!)(A + B! + C! + D)
=(A + C) (A + B! + C)(A + B! + D)(A + B! + C + D!)
=(A + C)(A + B! + C)(A + B! + C)
=(A + C)(A + B! + C)

is this correct?
please help! Been stuck on this problem for HOURS
 

WBahn

Joined Mar 31, 2012
33,192
Well, ask yourself if they agree for simple cases.

Q1) If A is HI, then the original expression is HI regardless of the state of any of the other inputs. Is this true of your result?

Q2) If A is LO but C is HI, then your result is HI regardless of the state of any of the other variables. Is this true of the original expression?
 
Top