Join free to take this lesson
Anyone can look around, but taking a lesson needs a free account. With one, your answers are checked step by step and your progress is saved, so you can stop and pick up where you left off on any device.
11 steps ยท about 18 min
By the end you can
- Use union, intersection and complement, and count with inclusion-exclusion
- Count subsets and functions between finite sets
- Decide whether a function is injective, surjective or bijective, and use the pigeonhole principle
Who it is for: You have done lessons 6.1 and 6.2.
The steps
- Two languages
- Sets and their operations
- Inclusion-exclusion
- Neither
- Counting subsets and pairs
- Pizza toppings
- Functions between sets
- Classify a function
- Count the functions
- Pigeonholes
- Why pigeonholes work
Discussion 0 comments
Log in to join the discussion.