Simplify the boolean equation

Question

I am trying to simplify this boolean expression:

F = A B ((A + C')') + B (A C + A' B) + (A + B)(A' + C D)

The resultant solution is supposed to be:

F = A C D + ('A B) + B C

But all I can get is

F = A C D + ('A B) + A B C + B C D

Help would be appreciated.

Checked on this page and it says minified form is what real solution is

Answer 1

From where you ended up:

$ACD + A'B + ABC + BCD =$ (Idempotence)

$ACD + A'B + A'B + ABC + BCD =$ (Adjacency)

$ACD + A'B + (A'BC + A'BC') + ABC + BCD =$ (Association and Commutation)

$ACD + (A'B + A'BC') + A'BC + ABC + BCD =$ (Absorption)

$ACD + A'B + (A'BC + ABC) + BCD =$ (Adjacency)

$ACD + A'B + (BC + BCD) =$ (Absorption)

$ACD + A'B + BC$

Answer 2

The supposed solution is correct.

Check the Karnaugh map as confirmation:

Answer 3

Alex Kemper's answer is, I suppose, the de facto way to simplify the expression.
Another way to conclude that $$ABC+A'B+ACD+BCD = BC+A'B+ACD,$$ using Boolean Algebra axioms, is the following: \begin{align} A'B + ACD + BC &= A'B +ACD + (A+A')BC\\ &= A'B + ACD + ABC + A'BC\\ &= (A'B + A'BC) + ACD + ABC\\ &= A'B + ACD + ABC. \tag{absorption} \end{align} Now, \begin{align} ABC+A'B+ACD+BCD = A'B + ACD + ABC &\Leftrightarrow BCD \leq A'B + ACD + ABC\\ &\Leftrightarrow BCD (A'B + ACD + ABC) = BCD. \end{align} But $$BCD (A'B + ACD + ABC) = (A'BCD) + (ABCD) + (ABCD) = (A + A') BCD = BCD.$$