A·(Ā + B) — Boolean simplification

coredistribution then null law

Answer

A · B

Why this example is worth doing

Distributing produces A·Ā + A·B, and the first product is identically 0 by the complement law, so the whole term vanishes and A·B survives. The teaching point is that a term going to 0 disappears from a sum while a term going to 1 swallows it — the two null laws behave oppositely and are routinely swapped. This example is also the standard proof of the absorption variant A·(Ā + B) = A·B, which is worth memorising in its own right because it appears constantly inside larger expressions.

Try your own input in the Boolean algebra simplifier. Simplify any expression to its minimal SOP and POS, one named law at a time.

How the answer is reached

Step by step

A · (A′ + B)A · A′ + A · BDistributive — A · (B + C) = A · B + A · C

A · A′ + A · B0 + A · BComplement — A · A′ = 0

0 + A · BA · BIdentity — A + 0 = A

Warning:

A · (A′ + B) simplifies to A · B in 3 steps. That is a proven minimum (1 term, 2 literals), not a best effort. It is the only minimum-cost form.

Quine–McCluskey

Prime implicants — Quine–McCluskey
#Term
1A · B
Minimum cover — Quine–McCluskey
#Cover
1A · B
Warning:

1 term(s), 2 literal(s); 1 essential prime implicant(s).

Truth table

Truth table — columns #, A, B, F
#ABF
0000
1010
2100
3111

Compare with

Open this example in the Boolean algebra simplifier

The field arrives filled in with this example’s input.

Note:

Notation this page assumes

  • Symbols: · is AND, + is OR, ⊕ is XOR, a prime or an overline is NOT. The field also takes ∧ ∨ ¬ ~ ! & | and the words.
  • Operator precedence, tightest first: NOT, then AND (including juxtaposition), then XOR/XNOR, then NAND/NOR, then OR, then IMPLIES, then IFF.
  • In a minterm index the first variable is the most significant bit, so over [A, B, C] minterm 5 is A·B̄·C.

Sources

  • Boole, An Investigation of the Laws of Thought (1854)
  • Shannon, “A Symbolic Analysis of Relay and Switching Circuits” (1938)