
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
- Each part describes the step of a strong induction proof:
- A sequence has c_1 = 1 and c_n = c_ n/2 + 1 for every n ≥ 2, where x is the greatest integer not more than x.
- The sequence 1, 2, 3, 5, 8, 13, 21, … has f_1 = 1, f_2 = 2 and f_k = f_k-1 + f_k-2 for k ≥ 3.
- Prove that there are no positive integers a, b, c with a³ + 2b³ = 4c³.
Teach it first
The free lesson teaches it with worked examples and practice problems.
Strong induction and well-ordering: the lesson ›More Chapter 4 worksheets: Mathematical induction
- 4.1How induction works: base case, hypothesis and step
- 4.2Triangular numbers
- 4.3Strong induction and well-ordering