Worked example: sum of products
A prime-number detector for the inputs 0 to 31, written A (most significant) to E.
F = Σm(2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31)
Simplified result
F = A'B'C'D + B'DE + A'C'DE + A'CD'E + AB'C'E + ABCE
- A'B'C'D — minterms (2, 3)
- B'DE — minterms (3, 7, 19, 23)
- A'C'DE — minterms (3, 11)
- A'CD'E — minterms (5, 13)
- AB'C'E — minterms (17, 19)
- ABCE — minterms (29, 31)