# week01 - MATHEMATICAL INDUCTION Original Notes adopted...

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

MATHEMATICAL INDUCTION Original Notes adopted from September 11, 2001(Week 1) c ± P. Rosenthal , MAT246Y1, University of Toronto, Department of Mathematics The Natural Numbers The set of natural numbers is the set { 1 , 2 , 3 , 4 , 5 ,... } , which is denoted by N (or sometimes N .) Principle of Mathematical Induction If S N such that a) 1 S b) ( k + 1) S whenever k S , then S = N . Example. Prove: 1 2 + 2 2 + 3 2 + ... + n 2 = n ( n +1)(2 n +1) 6 . Let S = { m : 1 2 + 2 2 + 3 2 + ... + m 2 = m ( m +1)(2 m +1) 6 } . We need to show that S = N . By Mathematical Induction, it will suﬃce to show that a) 1 S b) ( k + 1) S whenever k S Is 1 S ? 1 2 = 1(1+1)(2+1) 6 = 1 Yes. Now suppose k S , that is, 1 2 + 2 2 + 3 2 + ... + k 2 = k ( k + 1)(2 k + 1) 6 Then we must show that 1 2 + 2 2 + 3 2 + ... + k 2 + ( k + 1) 2 = ( k + 1)( k + 2)(2 k + 2 + 1) 6 First, 1 2 + 2 2 + 3 2 + ... + k 2 = k ( k + 1)(2 k + 1) 6 , and so 1 2 + 2 2 + 3 2 + ... + k 2 + ( k + 1) 2 = k ( k + 1)(2 k + 1) 6 + ( k + 1) 2 = k ( k + 1)(2

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 04/26/2011 for the course MATH 246 taught by Professor Applebaugh during the Spring '10 term at University of Toronto.

### Page1 / 3

week01 - MATHEMATICAL INDUCTION Original Notes adopted...

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

View Full Document
Ask a homework question - tutors are online