Discrete Mathematics and Proof · Chapter 4 · Lesson 4.3 · Printable PDF

Strong Induction and Well-ordering Worksheet with Answer Key

4 problems on strong induction and well-ordering. 2 pages, with a worked answer key.

4 problems2 pagesanswer key
Printable Strong induction and well-ordering worksheet with answer key - Discrete Mathematics and Proof (Page 1 PDF preview)
Page 1 of 2

Get this sheet

This sheetWorksheet and answer key, yours to keep.
$5
Buy
SubscriptionOpen any sheet in any course, up to 40 a month, keys included. Or $40 month to month.
$25/mo, billed yearly
Subscribe
Full Course Set470+ Discrete Mathematics and Proof PDF files, no limit, yours to keep.
$400once
Buy

Try one first: a free Chapter 1 worksheet (PDF, no sign-in).

The full Discrete Mathematics and Proof courseEvery lesson in teaching order, with over 470 printables.See the course ›

What's on the worksheet

  1. Each part describes the step of a strong induction proof:
  2. 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.
  3. 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.
  4. 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