F(A,B,C) = Σm(0,1,2,3,4,5,6,7) — Karnaugh map

introconstant 1; the whole map is one group

Answer

1

Why this example is worth doing

Every cell is a 1, so the single legal grouping is the entire map and the answer is the constant 1 — no variables at all. This is the degenerate case that breaks naive implementations, which try to emit a product term with zero literals and print an empty string. It also makes the size rule concrete: groups must be rectangles of 1, 2, 4 or 8 cells, and 8 is allowed on a 3-variable map. The tool draws the eight-cell group rather than refusing to draw anything.

Try your own input in the Karnaugh map solver. Group a 2- to 6-variable map yourself and have every group marked right or wrong.

How the answer is reached

Quine–McCluskey

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

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

Truth table

Truth table — columns #, A, B, C, F
#ABCF
00001
10011
20101
30111
41001
51011
61101
71111

Compare with

Open this example in the Karnaugh map solver

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

  • Karnaugh, “The Map Method for Synthesis of Combinational Logic Circuits” (1953)
  • Veitch, “A Chart Method for Simplifying Truth Functions” (1952)