QED
Sets · step 11 of 13

Venn diagrams & shading regions

A Venn diagram with n sets divides the universe into 2ⁿ regions, one for each combination of in/out choices — four regions for two sets, eight for three. Every set expression corresponds to a union of some of these regions, so shading is really a question about which of the 2ⁿ membership patterns satisfy the expression. That reframing makes even nested expressions routine.

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.

  1. Label every regionFor three sets label the eight regions by which of A, B, C the elements belong to, including the outside region.
  2. Test each region against the expressionTake a representative element of the region, evaluate the expression’s membership condition, and shade if it comes out true.
  3. Build up from the insideFor nested expressions, shade the innermost bracket lightly first, then apply the outer operation to that shading.
  4. Fill numbers innermost-first for countingStart with |A ∩ B ∩ C|, then work outward subtracting what is already placed. Each region should end with a non-negative number.

Worked example

Which region does A \ (B ∪ C) occupy, and how many of the eight three-set regions does (A ∩ B) ∪ C cover?

  1. A \ (B ∪ C) requires in A, not in B, not in C — exactly one region.
  2. For the second expression, list regions where the condition holds.
  3. C alone, C∩A, C∩B, C∩A∩B — four regions from C.
  4. Plus A∩B with C excluded — one more.

Answer. A \ (B ∪ C) is the single "A only" region; (A ∩ B) ∪ C covers five of the eight regions.

Where marks get dropped

These are the specific errors that cost credit on venn diagrams & shading regions questions — QED's rubric penalises each of them separately.

Practise this until it is automatic

Unlimited fresh questions

QED generates new venn diagrams & shading regions 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 Sets mastery is tracked so you know when this is exam-ready.

Venn diagrams & shading regions — frequently asked questions

Can a Venn diagram prove a set identity?

It is convincing and standard for two or three sets, but many courses require a formal element-chase or algebraic proof. Use the diagram to find the answer, then write the proof.

How many regions do n sets create?

2ⁿ, one for each in/out pattern. That is why diagrams become unusable past three or four sets and why indicator functions take over.

What is the difference between a Venn and an Euler diagram?

A Venn diagram always shows all 2ⁿ regions, even empty ones. An Euler diagram draws only the non-empty ones, so it encodes extra information about the sets.

The rest of Sets

Set-builder notation, operations, and set identities. Each subtopic below has its own method, worked example and mark-losing traps.

Ready to make venn diagrams & shading regions 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 →