Sets, Estimation & Miscellaneous
Set problems not primarily counting, estimation, pattern recognition, unit conversion
What you need to know
- Principle of Inclusion-Exclusion (PIE), two sets. (number in or ) (number in ) (number in ) (number in both). Those in both were counted twice, so subtract them once. Example: of students, like math, like art, and like both. Then like at least one, and like neither.
- PIE, three sets. Add the three groups, subtract the three overlaps of two groups, then add back the part in all three. (That middle part was added three times and subtracted three times.) Example: from to , the numbers divisible by , , or number .
- "Exactly one" and "exactly two" come from the regions of the Venn diagram, not from the PIE total. Example: above, like at least one subject, but only like exactly one.
- How big can the overlap be? Say there are things in all. The number in both and is at most the smaller of the two group sizes, and at least (size of ) (size of ) . If that is negative, the smallest overlap is . Example: with students, in math and in art, between and students are in both.
- Packing problems need two things: a lower bound from items that cannot share a container, and an actual packing that matches it. Example: boxes hold kg, and the items weigh kg. The total is kg, but no two s fit together, so at least boxes are needed. And works: , , , .
How AMC 10 tests it
- Survey problems (positions 3–12): two or three activities that overlap, plus a group that does none; one region is asked for.
- "At least how many do both?" The tool is the bound (size of ) (size of ) .
- Packing puzzles (positions 8–15): the trap is dividing the total size by the capacity and forgetting that items can't be split.
- Estimation problems (positions 1–10): round each number to one or two significant figures.
Standard approaches
- Draw the Venn diagram. Call the innermost region (all three) , and fill in the regions from the inside out.
- Use PIE with (number in at least one group) (number in none).
- For the largest or smallest possible overlap, decide which bound the question wants.
- For packing, list which combinations fit in one container, find the bound, then build a packing that reaches it.
Worked example
In a class of students, play soccer, basketball, and tennis. Ten play soccer and basketball, soccer and tennis, basketball and tennis, and play none. How many play exactly one sport?
(A) (B) (C) (D) (E)
Find the middle. Let students play all three. Since play none, play at least one. By PIE,
so .
Find the "exactly two" regions. The soccer-and-basketball players include the who plays all three, so play only those two. In the same way, play only soccer and tennis, and play only basketball and tennis.
Subtract. At least two sports: students. So exactly one sport: . (Check: the one-sport regions hold , , and .) The answer is .
Pitfalls
- Reading " play soccer and basketball" as leaving out the ones who also play tennis. Those include everyone who plays both, tennis or not.
- Forgetting the "none" group: in the example, the students in at least one sport number , not .
- In packing, stopping at the total divided by the capacity, rounded up. Above, , but boxes are needed.
- Rounding every number down in an estimate. Example: is about (it is ), not .
Traps that recur
- Forgetting that 1 through 24 are unconstrained and answering 50 (one from each of fifty imagined pairs). (2005 AMC 10B #25)
- Assuming the answer is just the 20% net change, or letting more students switch Yes-to-No than the 30% who answer No at the end. (2010 AMC 10B #12)
- Dividing total size 16.8 MB by 1.44 to get 12 disks, ignoring that files cannot be split and that 0.8 and 0.7 cannot share a disk. (2002 AMC 10A #11)
- Answering 4 from 52/12 = 4.33 rounded down, or 12 from misreading the question as the number of months. (2011 AMC 10B #11)
Problems, easiest first
Open any of them to try it here; the worked solution is on the problem's own page.