Simplifying Boolean expressions
Simplification means reaching an equivalent expression with fewer literals and operations, and in exams the route matters as much as the destination. The high-value moves are absorption (x + xy = x), the consensus-style reduction x + x′y = x + y, and factoring out a common term before applying the complement law. Each step must cite a law.
✓ Unlimited questions · marked criterion by criterion · no card needed
Method: how to approach it
The order below is what examiners expect to see, and each step carries its own marks.
- Expand or factor to expose a patternMultiply out brackets, or factor a common variable, until an absorption or complement pattern is visible.
- Apply absorption aggressivelyx + xy = x and x(x + y) = x delete whole terms. Look for them after every step.
- Use x + x′y = x + yThis is the workhorse: a complemented variable next to its uncomplemented partner can be dropped.
- Verify with a truth tableFor three variables an eight-row check confirms the simplified form matches the original — cheap insurance.
Worked example
Simplify xy + xy′ + x′y.
- Factor the first two terms: xy + xy′ = x(y + y′).
- = x·1 = x, by complement and identity.
- The expression is now x + x′y.
- Apply x + x′y = x + y.
Answer. x + y — reduced from six literals to two.
Where marks get dropped
These are the specific errors that cost credit on simplifying boolean expressions questions — QED's rubric penalises each of them separately.
- Cancelling terms as though this were arithmetic. There is no subtraction in Boolean algebra, so xy + x cannot "cancel" the x.
- Stopping too early. After each simplification, re-scan for new absorption opportunities created by the change.
- Simplifying to a form that is shorter but not equivalent. A quick truth-table check catches this immediately.
Practise this until it is automatic
Unlimited fresh questions
QED generates new simplifying boolean expressions problems on demand at warm-up, exam and challenge level, so you can drill this one skill until it stops costing you marks.
Marked like an examiner
Every answer is scored against a point-by-point rubric with partial credit, so you see exactly which step of the method broke down — not just a tick or a cross.
Answer in real notation
A one-tap symbol palette, a visual equation editor and a truth-table builder — or photograph your handwritten working and QED converts it to LaTeX.
Saved to your library
Every question you generate is kept and re-takeable as a timed exam, and your Boolean Algebra mastery is tracked so you know when this is exam-ready.
Simplifying Boolean expressions — frequently asked questions
Is the minimal form unique?
Not always. Some functions have two equally minimal sum-of-products forms, so an answer differing from the model solution may still be fully correct.
When should I use a Karnaugh map instead?
For three or four variables a K-map is faster and guarantees minimality. Algebraic simplification is required when the question says "using the laws".
What counts as "minimal"?
Usually the fewest product terms, then the fewest literals. State which measure you are minimising if the question is ambiguous.
The rest of Boolean Algebra
Axioms, laws, simplification and Boolean functions. Each subtopic below has its own method, worked example and mark-losing traps.
- 1Boolean axioms & laws
- 2The duality principle
- 3Simplifying Boolean expressions
- 4Boolean functions & truth tables
- 5Boolean algebra, logic & set algebra
- 6Sum-of-products & product-of-sums
- 7Karnaugh maps & minimal expressions
- 8Logic gates & translating circuits
- 9NAND / NOR universality
- 10Don’t-care conditions in minimisation
- 11Quine–McCluskey minimisation
- 12Half adders, full adders & multiplexers
- 13Shannon expansion & binary decision diagrams
Ready to make simplifying boolean expressions exam-proof?
Generate your first questions free — no card, no setup, no personal data stored. Practise until the method is second nature.
Start practising free →