4 Mathematical Induction

Patrick Cuthbertson February 25, 2014

Example 50. If n is a natural number, +1) then the sum of the f irst n numbers is n(n2 . Step 1. Show that it is true f or n = 1. =2 1 = 1(1+1) 2 2 = 1 T rue. +1) Step 2. Suppose f or some n 1, n(n2 is equal to the sum of the f irst n numbers. (Induction Hypothesis) Step 3. P rove that it is true f or n + 1. (n(n + 1)) + (n + 1) (by I.H.) 2 (n)(n + 1) + (2n + 2) 2 n2 + 3n + 2) 2 n2 + 2n + 1 + (n + 1) 2 (n + 1)(n + 2) 2

1 + 2 + 3 + + n + (n + 1)

= = = = =

(0.1) (0.2) (0.3) (0.4) (0.5)

+1) T heref ore, by induction, the sum of the f irst n numbers is n(n2 , f or all n 1.

P roblem 51. If n is a natural number, then the sum of the f irst n even numbers is n2 + n. Step 1. Show that it is true f or n = 1. 2 = 1 + 1 = 12 + 1 = 2 T rue. Step 2. Suppose f or some n 1, n2 + n is equal to the sum of the f irst n even numbers. (Induction Hypothesis) Step 3. P rove that it is true f or n + 1. 2 + 4 + 6 + + 2n + 2(n + 1) n2 + n + 2(n + 1) (by I.H.)
2

(0.6) (0.7) (0.8) (0.9)

= n2 + 3 n + 2 = n + 2n + 1 + (n + 1) = (n + 1) + (n + 1)
2

T heref ore, by induction, the sum of the f irst n even numbers is n2 + n, f or all n 1. P roblem 52. If n is a natural number, then the sum of the f irst n odd numbers is n2 . Step 1. Show that it is true f or n = 1. 1 = 12 = 1 T rue Step 2. Suppose f or some n 1, n2 is equal to the sum of the f irst n odd numbers. (Induction Hypothesis) Step 3. P rove that it is true f or n + 1. 1 + 3 + 5 + + (2n 1) + (2(n + 1) 1) = n2 + (2n + 1) (by I.H.) = = (n + 1)(n + 1) (n + 1)2

(0.10) (0.11) (0.12)

T heref ore, by induction, the sum of the f irst n odd numbers is n2 f or all n 1.

P roblem 53. If n is a natural number, +1) 2 ) . then the sum of the cubes of the f irst n natural numbers is ( n(n2 Step 1. Show that it is true f or n = 1. 13 = ( 1(1+1) )2 = 1 T rue 2 +1) 2 Step 2. Suppose f or some n 1, ( n(n2 ) is equal to the sum of the cubes of the f irst n natural numbers. (Induction Hypothesis) Step 3. P rove that it is true f or n + 1. n(n + 1) 2 ) + (n + 1)3 (by I.H.) 2 n4 n3 n2 = + + + n3 + 3n2 + 3n + 1 4 2 4 3 n3 13n2 n4 = + + + 3n + 1 4 2 4 (n + 1)(n + 2) 2 = ( ) 2 = (

13 + 23 + 33 + + n3 + (n + 1)3

(0.13) (0.14) (0.15) (0.16)

T heref ore, by induction, the sum of the cubes of the f irst n natural numbers +1) 2 ) , f or all n 1. is ( n(n2 P roblem 54. If n is a natural number, then n! 2(n1) . Step 1. Show that it is true f or n = 1. 1! = 1 2(11) = 1 T rue Step 2. Suppose f or some n 1, n! 2(n1) (Induction Hypothesis) Step 3. P rove that it is true f or n + 1. Lemma : Since n is a natural number, n+1 2 1. 1 2 3 n (n + 1) = (n!)(n + 1)
(n1)

(0.17) (0.18) (0.19) (0.20)

2 (n + 1) (by I.H.) n 2 (n + 1) = 2 2(n+1)1 (by Lemma) T heref ore, by induction, n! 2n1 f or all n 1.

P roblem 55. F or all n Nthe expression n2 + n + 41 is a prime number. Counterexample : If n = 41, then (41)2 + 41 + 41 = 1763 = 41 43 and theref ore not a prime number. (41)2 + 41 + 41

= =

1763 41 43

(0.21) (0.22)

and theref ore not a prime number.