
Page 1 of 2
Download
Get this sheet
SubscriptionOpen any sheet in any course, up to 40 a month, keys included. Or $40 month to month.
$25/mo, billed yearly
SubscribeTry one first: a free Chapter 1 worksheet (PDF, no sign-in).
What's on the worksheet
- Let $s_n
- For each set, say whether it is finite, countably infinite or uncountable, and give the reason in a sentence or two.
- For n, k N let $s_n
- Let W be the set of sequences w = (w(0), w(1), w(2), ) whose terms are all in \1, 2, 3\ and in which no two adjacent terms are equal:
Teach it first
The free lesson teaches it with worked examples and practice problems.
Uncountable sets and the diagonal argument: the lesson ›More Chapter 6 worksheets: Infinite sets
- 6.1Matching two sets one to one
- 6.2Countable sets
- 6.3Uncountable sets and the diagonal argument
- 6.4Cantor's theorem: no set matches its power set