A maxterm is an OR of all n variables, each appearing once, plain or barred. Because a sum is 0 only when every literal is 0, a maxterm is 0 on exactly one row and 1 on all the others. Mᵢ names the maxterm that is 0 on row i.
Building Mᵢ: write i in binary with n bits (A is the most significant bit). Then:
- a 0 bit gives the plain variable,
- a 1 bit gives the barred variable.
That is the opposite of a minterm. The reason: each literal must be 0 on row i, and a plain A is 0 only when A = 0.
The one-line rule: a minterm matches its row; a maxterm opposes it. In fact Mᵢ is the complement of mᵢ, by de morgans laws.
Maxterms are the building blocks of the canonical POS. ANDing one maxterm for each row where F = 0 reproduces the truth table exactly; see product of maxterms.
Self-check that never fails: plug the row into your sum. You should get 0 + 0 + … + 0.
| 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 1 |
| 0 | 1 | 0 | 0 |
| 0 | 1 | 1 | 1 |
| 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 1 |
| 1 | 1 | 0 | 1 |
| 1 | 1 | 1 | 1 |