← 🧮 Boolean Algebra, Canonical Forms & K-Maps
Subtopic 2 of 5

2.2Minterms, maxterms and canonical forms

The idea

A minterm is a product that includes every variable once and is 1 on exactly one row of the truth table. A maxterm is a sum that is 0 on exactly one row. Any function is a sum of minterms or a product of maxterms.

Think of it like this: Listing the guest list (1 rows) or the banned list (0 rows) of a party: either list defines who gets in.

Why it exists

GATE asks you to count minterms, convert between Σm and ΠM, and read the canonical form from a truth table.

How it works

  1. Write the truth table with variables in order A (MSB), B, C.
  2. Σm lists the row numbers where F = 1; ΠM lists the row numbers where F = 0.
  3. F′ has the opposite lists: its minterms are the maxterms of F.
  4. A function with k minterms and n variables has 2ⁿ − k maxterms.

Worked example: F(A,B,C) = Σm(1,2,5,7)

The remaining rows are 0, 3, 4, 6, so F = ΠM(0,3,4,6). F′ = Σm(0,3,4,6).

Now play with it

  • →Type A^B^C and see the parity function: minterms 1, 2, 4, 7.
  • →Set n = 4 and k = 5 in the calculator to see the number of maxterms.
mABCF
00000
10011
20101
30111
41001
51011
61100
71111
Minterms Σm1, 2, 3, 4, 5, 7
Maxterms ΠM0, 6
Number of 1s6
Canonical SOP: A'B'C + A'BC' + A'BC + AB'C' + AB'C + ABC Canonical POS: (A + B + C)(A' + B' + C)
Rows in the truth table16
Maxterms of F11
Minterms of F′11
Minterms of A⊕B⊕… (parity)8

F has k minterms and 2ⁿ − k maxterms; its complement swaps the two lists.

Check yourself

F(A,B,C) = Σm(0,2,3,5). Its canonical product of maxterms is

Remember: Σm lists the 1 rows, ΠM lists the 0 rows; together they cover all 2ⁿ rows.
Exam notes (the dense version)

With n variables there are 2ⁿ minterms (a product containing every variable once; mᵢ = 1 only on row i) and 2ⁿ maxterms (a sum; Mᵢ = 0 only on row i, and Mᵢ = mᵢ′). F = Σm(rows where F = 1) = ΠM(rows where F = 0). The sum of all minterms is 1. The canonical SOP of F′ uses the rows missing from F. A function with k minterms has 2ⁿ − k maxterms. XOR of n variables has 2ⁿ⁻¹ minterms (the odd-parity rows).

Previous year questions: Boolean Algebra, Canonical Forms & K-Maps (27)

PYQs are grouped by topic, so this is the full set for Boolean Algebra, Canonical Forms & K-Maps; try the ones that match this subtopic. Open all 27 on the topic page.