Please simplify this logic expression for me with helping boolean algebra :
A'C'D + A'BD + BCD + ABC + ACD'
I know that must use consensus theorem .
my solve :
STEP 1 : Terms 1 & 3 ---eliminate---> Term 2
STEP 2 : Terms 3 & 5 ---eliminate---> Term 4
STEP 3 : Terms 2 & 4 ---eliminate---> Term 3
But truth table said step 3 is incorrect . but why ?
please tell me why step 3 is Wrong ?
and tell me What is the simplest form of it ?
I think you are confusing during the application of minimization by using Boolean algebra formula
First you apply consensus theorem for terms 1,2,3 by taking D as a common factor. This helps in removing the term 2. So the minimized expression is A'C'D + BCD + ABC + ACD'
Now combining the last three terms similarly leads to elimination of the term ABC
So the minimized expression is A'C'D + BCD + ACD'.
Here you don't have any terms for which consensus theorem can be applied i.e., so you question describes there were no more 2 and 4 terms to eliminate the term 3.
So the minimized expression is A'C'D + BCD + ACD'