Lesson 8 - Induction Imagine you have a staircase. We need...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Induction Imagine you have a staircase. We need two things in order to be able to walk up it, no matter how long it is. The first step must be safe. Also every step after a safe step must be safe. Mathematically we need two things for a proof. We need to establish that the first (step 1) step is true. Also, assuming a step is true (step k), the next step must be true(step k+1). We call these the base case and the inductive step . Let us do this example: 1 + 2 + ... + n = n ( n + 1) 2 For the base case, we need to verify that the statement is true for n = 1. LHS = 1 RHS = (1 * 2) / 2 = 1 For the inductive step, we assume that what we want is true for n = k . This means: 1 + 2 + ... + k = k ( k + 1) 2 Now we need to show the statement for n = k + 1: 1 + 2 + ... + k + ( k + 1) = ( k + 1)(( k + 1) + 1) 2 = ( k + 2)( k + 1) 2 Basically, we start with the left side and use our assumption to get the right side. LHS
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

Lesson 8 - Induction Imagine you have a staircase. We need...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online