- #1
Rectifier
Gold Member
- 313
- 4
The problem
I am trying to show that ##a'c' \vee c'd \vee ab'd ## is equivalent to ## (a \vee c')(b' \vee c')(a' \vee d) ##
The attempt
## (a \vee c')(b' \vee c')(a' \vee d) \\ (c' \vee (ab'))(a' \vee d)##
The following step is the step I am unsure about. I am distributing the left parenthesis over the right.
## (c' \vee (ab'))(a' \vee d) \\ c'a \vee c'd \vee ab'a' \vee ab'd##
I am almost there but the term ##ab'a'## differs. I suspect that you can remove that term since it does not afect the output because it is always false. What do you say about that?
I am trying to show that ##a'c' \vee c'd \vee ab'd ## is equivalent to ## (a \vee c')(b' \vee c')(a' \vee d) ##
The attempt
## (a \vee c')(b' \vee c')(a' \vee d) \\ (c' \vee (ab'))(a' \vee d)##
The following step is the step I am unsure about. I am distributing the left parenthesis over the right.
## (c' \vee (ab'))(a' \vee d) \\ c'a \vee c'd \vee ab'a' \vee ab'd##
I am almost there but the term ##ab'a'## differs. I suspect that you can remove that term since it does not afect the output because it is always false. What do you say about that?