Worked example: product of sums
A function that is 0 for the input combinations 1, 3 and 7.
F = ΠM(1, 3, 7)
Simplified result
F = (A+C')(B'+C')
- (A+C') — maxterms (1, 3)
- (B'+C') — maxterms (3, 7)
Product of sums is the dual of sum of products. Describe your function once and read the answer as a product of OR terms.
Range 0–7. Use ranges like 4-7. Every number not listed is 1.
F = Σm(0, 2, 4, 5, 6)
5 ones · 0 don't-cares · 3 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 =(A+C')(B'+C')
Every input row is evaluated against the simplified expression. A don't-care (X) row may give 0 or 1.
| m | A | B | C | Your F | Result | Status |
|---|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 1 | 1 | Match |
| 1 | 0 | 0 | 1 | 0 | 0 | Match |
| 2 | 0 | 1 | 0 | 1 | 1 | Match |
| 3 | 0 | 1 | 1 | 0 | 0 | Match |
| 4 | 1 | 0 | 0 | 1 | 1 | Match |
| 5 | 1 | 0 | 1 | 1 | 1 | Match |
| 6 | 1 | 1 | 0 | 1 | 1 | Match |
| 7 | 1 | 1 | 1 | 0 | 0 | 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 = (A + \overline{C}) (\overline{B} + \overline{C})Instead of grouping the ones, you group the zeros. Each group of zeros becomes a sum term in which a variable appears complemented if it is 1 in the group and plain if it is 0. The function is the AND of those sums.
Both are correct for the same function. POS can need fewer gates when a function has few zeros, and it maps naturally onto OR–AND or NOR-only circuits. Switch between the forms at any time; the colours and group cards follow.
A function that is 0 for the input combinations 1, 3 and 7.
F = ΠM(1, 3, 7)
Simplified result
F = (A+C')(B'+C')
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.
Pick “POS” in the result header. The input can be any of the five methods.
A maxterm is a sum that is 0 for exactly one input combination. Listing the maxterms of a function means listing the inputs where it is 0.
Yes: a don't-care may join a group of zeros to make it bigger, but it never has to be covered.