1. What the source does and does not say
This pencil-and-paper activity asks what two group totals can tell us about their overlap. It is an original teaching resource by Figran Team, prepared with AI assistance. Figran is a commercial AI-assisted visual creation service. The activity is free to use without a Figran account or any drawing software.
Imagine a universe U containing exactly 20 distinct cards. A card can carry a circle mark, a stripe mark, both marks, or neither mark. Let A be the set of cards carrying a circle and B the set carrying a stripe. Every card is assessed for both marks; there are no missing or unknown classifications in this invented source. The source reports |A| = 12 and |B| = 9. It does not report which cards have both marks.
The vertical bars mean the number of distinct cards in a set. They do not denote a length, a percentage, or a count of marks. A card with both marks is one card in U, one member of A, and one member of B.
All counts and proposed versions below are fictional. They are not observations from a class, experiment, survey, product test, or research study. Work from the stated facts rather than estimating the intersection from how two circles happen to be drawn.
2. Separate four regions before adding counts
Write k for the number of cards in both A and B. The four mutually exclusive regions then have these counts:
| Region | Count of distinct cards | Reason |
|---|---|---|
| A only | 12 - k | Remove the shared cards from A's total. |
| Both A and B | k | This is the unknown intersection. |
| B only | 9 - k | Remove the same shared cards from B's total. |
| Neither A nor B | k - 1 | Subtract the union, 21 - k, from U's total of 20. |
Every card is in exactly one of these four regions. Adding the four counts gives (12 - k) + k + (9 - k) + (k - 1) = 20. This partition is a way to check the arithmetic, not an extra observation that determines k.
The union A or B means cards with at least one of the two marks, including cards with both. Its count is 12 + 9 - k = 21 - k. Adding 12 and 9 alone counts each shared card twice, so subtract k once to leave each card in the union counted once.
Exactly one mark has a different count: (12 - k) + (9 - k) = 21 - 2k. Do not use this expression for the union, because it excludes all cards with both marks. The expression 12 + 9 = 21 is the number of set memberships across A and B, not necessarily the number of distinct cards with a mark.
3. Find the possible overlap, not an invented exact value
A region cannot contain a negative number of cards. From 9 - k >= 0, k cannot exceed 9. From k - 1 >= 0, k cannot be below 1. The condition 12 - k >= 0 adds no tighter upper bound here. Since cards are indivisible, k must be an integer.
Thus the feasible values are k = 1, 2, 3, 4, 5, 6, 7, 8, or 9. Each is attainable: assign the indicated nonnegative number of distinct cards to each of the four regions. For example, the following three complete versions all match the same reported totals of 20, 12, and 9.
| Version | A only | Both | B only | Neither | At least one | Exactly one |
|---|---|---|---|---|---|---|
| L: k = 1 | 11 | 1 | 8 | 0 | 20 | 19 |
| M: k = 5 | 7 | 5 | 4 | 4 | 16 | 11 |
| H: k = 9 | 3 | 9 | 0 | 8 | 12 | 3 |
For each row, A only + Both = 12; B only + Both = 9; and A only + Both + B only + Neither = 20. These are alternative possible sources, not three measurements from the same inventory. A polished drawing of version M does not establish that the original source actually contained five shared cards.
More generally, if a fully classified finite universe has N objects, A has a objects, and B has b objects, with integer 0 <= a,b <= N, the intersection k must satisfy max(0, a + b - N) <= k <= min(a,b). The lower bound follows from the union fitting inside N; the upper bound follows because a shared object must belong to both groups. This activity concerns two sets only. Three-set diagrams require more intersection information.
4. Use an extra fact only when it is actually supplied
If a separately supplied fact says exactly four cards have neither mark, then k - 1 = 4 and k = 5. The partition is version M. If instead the additional fact says the union contains 16 cards, then 21 - k = 16 also gives k = 5. The two statements are equivalent here because U contains 20 fully classified cards.
An additional claim that exactly 12 cards have exactly one mark is inconsistent with this source: 21 - 2k = 12 would give k = 4.5. That is not a possible count of distinct cards. In fact, the possible exactly-one counts are 19, 17, 15, 13, 11, 9, 7, 5, and 3. They are all odd for these fixed marginal totals. Correctly checking a numerical bound alone would miss the integer constraint.
The statement B is a subset of A is different from the statement that A and B are disjoint. If B is a subset of A, all nine B cards are shared, so k = 9 and version H is feasible. Disjoint sets would require k = 0, which is impossible here: the union would need 21 distinct cards inside a 20-card universe.
Do not assume an extra rule just because it yields a convenient answer. In particular, neither a drawn overlap nor multiplication of the two group shares establishes the actual shared count. Relationships between mark assignments require their own source evidence or an explicitly labelled hypothetical model. This activity supplies neither a sampling model nor a claim of statistical independence.
5. Seven learner tasks
- Define the counting unit and the four exclusive regions. Explain why 12 + 9 = 21 does not contradict the existence of only 20 cards.
- Derive the full integer range for k. Test proposed overlaps k = 0 and k = 10 by identifying the specific condition each violates.
- Check every count in versions L, M, and H. Give two different versions with the same reported totals, and explain why that disproves a unique inferred overlap.
- An actual additional record states that four cards have neither mark. Find k, all four region counts, the union count, and the exactly-one count. State which result depends on that additional record.
- A caption says that exactly 12 cards have exactly one mark. Decide whether any integer k can satisfy it while preserving the three original totals. Give the possible exactly-one counts.
- Compare the proposed statements B is a subset of A and A and B are disjoint. Which is feasible? Supply its four-region partition and explain the other statement's contradiction.
- Write one caption for a diagram made only from the original totals and another caption for version M when the additional neither count is supplied. Keep observed source facts, possible values, and hypothetical choices distinct.
6. Worked answers and a diagram check
- The unit is a distinct card. The four regions are A only, both A and B, B only, and neither. A shared card contributes one membership to each reported group total, so it contributes twice to 12 + 9 but only once to the 20-card universe. The sum of group memberships can exceed the number of distinct cards without any contradiction.
- Nonnegative B-only count requires k <= 9; nonnegative neither count requires k >= 1. With integer k, all values from 1 through 9 are feasible. For k = 0, the union would be 21 and the neither count would be -1. For k = 10, the B-only count would be -1, and an intersection of ten would exceed B's total of nine. Either negative region count is impossible.
- L has regions 11, 1, 8, 0; M has 7, 5, 4, 4; H has 3, 9, 0, 8. Their four-region sums are all 20, and each row gives group totals 12 and 9. Their unions are 20, 16, and 12; their exactly-one counts are 19, 11, and 3. L and H alone already demonstrate different feasible overlaps for the same original totals. None is uniquely selected by those totals.
- The additional record yields k = 5. A only = 7, both = 5, B only = 4, and neither = 4. The union is 16 and exactly one is 11. These exact values depend on the additional record; without it, only the feasible range and formulas are established. Labelling version M as the actual inventory without that record would add an unsupported fact.
- No integer solution exists: k = 4.5 would be required. As k runs from 1 to 9, exactly one runs through 19, 17, 15, 13, 11, 9, 7, 5, and 3. A result of 12 is within the broad numeric span 3 to 19 but is still impossible. An inconsistent extra claim calls for source clarification, not rounding 4.5 to an invented overlap.
- B as a subset of A is feasible with k = 9 and regions A only = 3, both = 9, B only = 0, neither = 8. Disjointness is not feasible because k = 0 would force 21 distinct marked cards into U. Nesting is one possible source structure here, not something the two group totals alone prove.
- A suitable original-facts caption is: "Fictional universe of 20 distinct, fully classified cards: 12 carry a circle and 9 carry a stripe. The shared count is not supplied; its feasible integer values are 1 through 9. Any shown intersection is schematic unless an additional fact fixes it." With the extra record, use: "Fictional 20-card inventory with 12 circle cards, 9 stripe cards, and 4 cards with neither mark. The partition is 7 circle only, 5 both, 4 stripe only, and 4 neither; 16 have at least one mark. Counts, rather than drawn areas, specify membership."
Before sharing a two-set teaching diagram, record U's definition and size, each group's inclusion rule, whether classifications are complete, the distinct-object counting unit, the source version, and which intersection or outside counts are actually supplied. Confirm that each region is a nonnegative integer and that the four regions sum to the universe. Check the group totals again by adding their exclusive and shared regions.
Use the wording at least one, both, exactly one, or neither explicitly. If the source supplies only marginal totals, show the feasible range or label any selected partition as hypothetical. Do not silently remove the outside region, treat overlapping memberships as distinct objects, or claim that decorative circle areas encode the counts. No actual image or area-scaled drawing is supplied by this text-only exercise.
7. Attribution, reuse, and limits
Created by Figran Team with AI assistance. Figran is a commercial AI-assisted visual creation service: figran.net. This is a disclosed brand-affiliated teaching activity, not an independent review. The author checked the finite-count arithmetic; no independent assessment, classroom trial, learning benefit, scientific finding, or product performance is claimed.
The original educational text, invented counts, tasks, and worked explanations are offered under Creative Commons Attribution 4.0 International. Attribute Figran Team, identify this activity, link to the licence, and indicate changes when adapting it. This permission excludes Figran software and brand assets, Mataroa software and interfaces, and third-party material.
Public contact: support@figran.net. No personal data, student roster, real experimental results, images, or executable code are included. The exercise is self-contained and can be used without purchasing or visiting the commercial service.