Boolean Algebra Calculator

Type a statement with and, or and not to simplify it.

Variables are single letters. Use and, or, not, xor, implies, iff, or the symbols ∧ ∨ ¬ ⊕ → ↔, and brackets.

Try

Result

You entered(A∨B)∧(A∨C)(A \lor B) \land (A \lor C)

A∨(B∧C)\displaystyle A \lor (B \land C)

Boolean algebra notation

A+BC\displaystyle A + BC

Minterms

∑m(3,4,5,6,7)\displaystyle \textstyle\sum m(3, 4, 5, 6, 7)
Show the work
  1. Minterms from the truth table

    List every row of the truth table (8 rows for 3 variables) where the statement is true; each row is a minterm, numbered by reading A, B, C as a binary number (true = 1).

    Using f=∑m(… )f = \sum m(\dots)

    f(A,B,C)=∑m(3,4,5,6,7)f(A, B, C) = \textstyle\sum m(3, 4, 5, 6, 7)
  2. Prime implicants (Quine–McCluskey)

    Combine minterms that differ in exactly one variable — that variable drops out — and repeat with the results until nothing more combines. What is left are the prime implicants (with the minterms each covers).

    Using XA+XA‾=XXA + X\overline{A} = X

    BC (3,7), A (4,5,6,7)BC\ (3, 7),\ A\ (4, 5, 6, 7)
  3. Essential implicants and the cover

    Every prime implicant used is essential: it alone covers some minterm.

    essential: BC, A\text{essential: } BC,\ A
  4. Check

    The result agrees with the statement on all 8 rows of the truth table.

  5. Result

    The simplest sum of products.

    A∨(B∧C)(A+BC)\begin{gathered} A \lor (B \land C) \\ \left(A + BC\right) \end{gathered}

Worked examples