Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I'm trying to completely simplify

$$F_0 =A' B' C' D' + A' B' C' D + A B' C' D' + A B' C' D + A B' C D$$

I got as far as

$$\begin{align} &= A’B’C’ + A B' C' D' + A B' D\\ &= A’B’C + AB’(C’D’+D)\\ &= A’B’C + AB’(C’D’+D)\\ &= A’B’C + AB’(C’+D)\\ &= B’((A’C)+A(C’+D))\\ &= B’(A’C+AC’+AD)\\ &= B'A'C+B'AC'+B'AD\end{align}$$

Unfortunately two different pieces of software both returned


1) Can anyone prove (without benefit of a truth table) that the two statements are equivalent?

2) What are some general strategies in the early stages of boolean simplification that will help me avoid getting stuck?

Many thanks in advance


share|cite|improve this question

Your second line, where you have $A'B'C$, should read $A'B'C'$. Once that's fixed, your steps from there should get you what you need, with minor corrections. In particular,

$$\begin{align}F_0 &= A’B’C’ + A B' C' D' + A B' D\\ &= A’B’C' + AB’(C’D’+D)\\ &= A’B’C' + AB’(C’D’+D)\\ &= A’B’C' + AB’(C’+D)\\ &= B’((A’C')+A(C’+D))\\ &= B’(A’C'+AC’+AD)\\ &= B'((A'+A)C'+AD)\\ &= B'(C'+AD)\end{align}$$

More generally, I'd say your steps look fine. Just be careful not to drop any symbols.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.