I have an exam due in about four days, I have to simplify about 7 boolean statements similar to the one below, using the distributive method, I think, and the basic boolean laws. If someone would give me a hand simplifying the first one and kind of explain what they are doing i should be ok with the other 6. I've been trying this for a week.
Where A' = not A, + equals or, AB= A*B
A'B'C'D'+A'BC'D'+A'B'CD+AB'CD'+A'BCD'+ABCD'+A'B'C'D+AB'C'D
If any one gets a chance and does it the commutative way the result should be AC+A'C'+B+D, I don't think you can simplify it that far using distributive. The Kmap answer is the same as outlined for commutative.
Please help someone,
Regards Aaron
Where A' = not A, + equals or, AB= A*B
A'B'C'D'+A'BC'D'+A'B'CD+AB'CD'+A'BCD'+ABCD'+A'B'C'D+AB'C'D
If any one gets a chance and does it the commutative way the result should be AC+A'C'+B+D, I don't think you can simplify it that far using distributive. The Kmap answer is the same as outlined for commutative.
Please help someone,
Regards Aaron