Worked example: product of sums
A four-variable function that is 0 on five input combinations.
F = ΠM(0, 2, 5, 8, 10)
Simplified result
F = (B+D)(A+B'+C+D')
- (B+D) — maxterms (0, 2, 8, 10)
- (A+B'+C+D') — maxterms (5)
Given the function as ΠM(…), list the inputs where the output is 0. The solver converts, simplifies and checks the result.
Range 0–15. Use ranges like 4-7. Every number not listed is 1.
F = Σm(1, 3, 4, 6, 7, 9, 11, 12, 13, 14, 15)
11 ones · 0 don't-cares · 5 zeros
1–3 characters, starting with a letter. Names must be different from each other.
Updates as you edit. Hover a term or a card to see its group on the map.
F =(B+D)(A+B'+C+D')
Every input row is evaluated against the simplified expression. A don't-care (X) row may give 0 or 1.
| m | A | B | C | D | Your F | Result | Status |
|---|---|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | Match |
| 1 | 0 | 0 | 0 | 1 | 1 | 1 | Match |
| 2 | 0 | 0 | 1 | 0 | 0 | 0 | Match |
| 3 | 0 | 0 | 1 | 1 | 1 | 1 | Match |
| 4 | 0 | 1 | 0 | 0 | 1 | 1 | Match |
| 5 | 0 | 1 | 0 | 1 | 0 | 0 | Match |
| 6 | 0 | 1 | 1 | 0 | 1 | 1 | Match |
| 7 | 0 | 1 | 1 | 1 | 1 | 1 | Match |
| 8 | 1 | 0 | 0 | 0 | 0 | 0 | Match |
| 9 | 1 | 0 | 0 | 1 | 1 | 1 | Match |
| 10 | 1 | 0 | 1 | 0 | 0 | 0 | Match |
| 11 | 1 | 0 | 1 | 1 | 1 | 1 | Match |
| 12 | 1 | 1 | 0 | 0 | 1 | 1 | Match |
| 13 | 1 | 1 | 0 | 1 | 1 | 1 | Match |
| 14 | 1 | 1 | 1 | 0 | 1 | 1 | Match |
| 15 | 1 | 1 | 1 | 1 | 1 | 1 | Match |
Hover a gate to highlight its group · drag to pan · Ctrl/⌘ + scroll or the buttons to zoom.
Files always use the light theme so they print cleanly.
F = (B + D) (A + \overline{B} + C + \overline{D})A maxterm is a sum of all the variables that is 0 for exactly one input combination: a variable is complemented when it is 1 in that combination. A function is the AND of the maxterms where it should be 0.
Every cell that is not a maxterm and not a don't-care is a minterm. The solver stores one function and shows it either way, so you can enter maxterms and still read the SOP result.
A four-variable function that is 0 on five input combinations.
F = ΠM(0, 2, 5, 8, 10)
Simplified result
F = (B+D)(A+B'+C+D')
Up to 64 cells, with layered maps for 5 and 6 variables.
Map, truth table, expression, minterm list or maxterm list — switch freely.
Exact cover search over all prime implicants, with every equally good alternative on offer.
X cells enlarge groups but never have to be covered.
Groups across the map edges are drawn as open brackets, the way textbooks show them.
AND–OR, OR–AND, NAND-only or NOR-only schematics with zoom and gate counts.
Every answer is re-evaluated against your input; a truth table flags any mismatch.
Quine–McCluskey tables, the prime-implicant chart and Petrick's method.
PDF report, PNG/SVG, LaTeX, Verilog, VHDL, C, and a link that reopens your problem.
Everything runs in your browser. Nothing you enter is uploaded.
The listed cells are the ones where F = 0. Everything unlisted is 1, except cells listed as don't-cares.
You choose: the form selector is independent of how you entered the function.