I have the Boolean expression: F = A'B'C'D + A'BC'D' + ABC + AB'C'D' + ABCD'. Note that the ' indicates the negation of the variable by my convention.
I am trying to show that F = BC + A'C' + B'D' is a logical solution from the above.
I first sat down and tried to think about a way to approach it, as I am some years removed from tackling them. It seemed out of the question to attempt a truth table for something so large, so I resolved to try a Karnaugh Map. However, I'm a little confused as to how to approach the ABC term that has no D. How do I include it in the Karnaugh Map? Is it a "don't care" term? Is there a simpler way I could be approaching things?
Any pointers in the right direction would be appreciated!
EDIT: There is additional information I was confused about. Beneath F(A,B,C,D) is:
D(A,B,C,D): Σ(0,2,5,6,7,10,11)
I thought this was a separate function, but now it seems like these are the don't care conditions for the above. I have followed the advice of expanding the three variable term and added the don't cares to my table and I think I have proven the solution.