A + A·B — Boolean simplification

introabsorption; 1 term, 1 literal

Answer

A

Why this example is worth doing

Absorption is the law students distrust most, because the second term looks like it must contribute something. It cannot: every row where A·B is 1 already has A equal to 1, so the OR gate's second input never changes an output that was 0. The page shows the two-row truth-table proof next to the derivation A + A·B = A·(1 + B) = A·1 = A, which routes through the annulment law 1 + B = 1 — the step people skip and then cannot reproduce in an exam.

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 · BAAbsorption — A + A · B = A

Warning:

A + A · B simplifies to A in 1 step. That is a proven minimum (1 term, 1 literal), not a best effort. It is the only minimum-cost form.

Quine–McCluskey

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

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

Truth table

Truth table — columns #, A, B, F
#ABF
0000
1010
2101
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)