Trying to simplify ab'c(bd+cde)+ac'. book answer indicates a(c'+b'de) I get a(c"+b'cde). How was the c eliminated? need help

randb

 

irrelevant, misread the question.

 

But there's no point simplifying it further if it is wrong to begin with.

So first determine if

a(c'+b'de) =? a(c"+b'cde)

(c'+b'de) =? (c"+b'cde)

On the left hand side, if c is false, then the expression is true regardless of the other values. Is that also the case for the right hand side? If not, then you know that one of them is wrong. So ask the same sanity check question of the original expression.

ab'c(bd+cde)+ac' = a(b'c(bd+cde)+c')

If c is false, then the second factor on the right hand side is true regardless of the other values. So the book answer at least has a chance of being correct, but your's does not. So step back and redo your work until you pass all the sanity checks you can think of.

 

Sorry I just realized when checking replies I had made a typo on the answer I came up with in my post. Should be a(c'+b'cde) not c''.

 

Sorry I just realized when checking replies I had made a typo on the answer I came up with in my post. Should be a(c'+b'cde) not c''.

In boolean algebra, when you have (X'+XY), it can be simplified to X'+Y. Now, by applying this rule to the inside of the parentheses in your answer, you have c' on one side of the "OR" and c on the other. So because of that, you can eliminate the c on the right-hand side.

 

DerStrom8

Thank you

 

DerStrom8

Thank you

Anytime randb. Glad to help!

By the way, welcome to AAC!

 

In boolean algebra, when you have (X'+XY), it can be simplified to X'+Y. Now, by applying this rule to the inside of the parentheses in your answer, you have c' on one side of the "OR" and c on the other. So because of that, you can eliminate the c on the right-hand side.

But be sure you understand why you can make this simplification.

In words, if X is False, then the expression is True because of the first term irrespective of the second. But if X is True, then the first term doesn't matter (we know it is False) and in the second term we know that X is True so it really doesn't matter there, either.

Using Boolean Algebra:

X'+ XY = X'(Y+Y')+ XY
= X'Y + X'Y' + XY
= (X'Y + X'Y) + X'Y' + XY
= (X'Y + X'Y') + (X'Y + XY)
= X'(Y+Y') + (X'+X)Y
= X' + Y

 

WBahn

Thank you for the info.

 

You are more than welcome. Look forward to seeing you around AAC!

 

I also read that any OR can be distributed over an AND operation?

a+(a'*b)= (a+a')(a+b)
1*(a+b)
a+b

could this also be used?

thank you

 

Yes. Actually that's a much cleaner way to do it, but distributing the OR over AND is a property that few people are comfortable with because it is a property that does not hold for normal addition over multiplication and therefore violates the properties that we normally associated with those operator symbols. So, to use it, you may need to convince your audience that you really can do it (depending, of course, on your audience).

It's actually a good little exercise to see if you can prove it via algebraic manipulation (as opposed to exhaustive brute force via a truth table).