Proof by Induction

There are many relationships (formulas) in mathematics which include indices. One of the most common type is formula associated with sequences and series. For example the formulas for the partial sums of series. n = 2+ 1) t n) For an arithmetic series S (1 ( d n 2 For a geometric series S 1 = n
n t 1r) ( 1r

Here n is an index that can take on the value of any positive integer. Mathematicians use proof by induction to show that these formulas are true for any positive integer value for n. Proof by induction works on the same principle as the domino chain. You set up a string of dominos on end close enough together so that each domino hits and knocks down the domino that follows it. Then you push down only the first domino and all of the others fall down in order. The relationship is if the kth domino falls then the k+1st domino will fall; each domino pushes the next one. If I push the first, it pushes the second, and the second pushes the third and the third pushes the fourth etc.

Induction Principle
1. Show that the relationship you are proving is true for the smallest value of the index (If the first domino is pushed it will fall) 2. Show that if the relationship is true for an arbitrary value of the index(k for example) that implies that it is true for the next value of the index (k+1) (If the kth domino falls the k+1st domino will fall) Since n=1 is true and this implies n=2 is true then if n=2 is true this implies n=3 is true etc. 3. The relationship is then true for all values of the index. (All the dominos will fall) r n + n Example 1: A law of exponents states that a a Use an induction proof to show this is true ar = for all positive integers n. r 1 + 1 1. Show it is true for n=1 a a ar = ar is r factors of a multiplied together. Definition of exponents a1 is 1 factor of a Definition of exponent=1 ra1 is r+1 factors of a multiplied together a Definition multiplication r+1 factors of a multiplied together is ar+1 Definition of exponents QED 2. Assume it is true for n=k (any arbitrary value of the index) r k + k r+ r k 1 + k + If a a true show this implies a =1 a r is = aa r k r + k Start with a a Assumed true a = r 1 r 1 k + k Multiplication property of equality a= aa a a r k 1 r 1 + k a ) a a a a Associative property multiplication (= r+ r 1 k 1 + k + From step one. QED a= aa n r r n a a Example 2: Another law of exponents states ( = . Use an induction proof to show that this is ) true for all positive integers n.

Example 3: Prove by induction that the partial sum formula for an arithmetic series is true for all n = 2+ 1) t n) positive integers n, that is S (1 ( d n 2 1. Show for n=1
1 S= ( t +1 1 ) 2 ( ) d 1 1 2 1 S= ( t) 2 1 1 2 S=1 t 1

The one term sum is equal to the first term QED k = 2 k1 and t+ ) d 2. Assume true for n=k S (1 ( ) show this implies the formula is true for k+1 k 2 k1 + 2 (d t k That is S = ( +)) k + 1 1 2
S 1 =S +tk+ k+ k 1 tk+ =t1 +k d 1 k S 1 = (2 1 +(k1 )+t1 +k t )d d k+ 2 2 k+k(k1 t )d+2 1 +2 d t k S 1= 1 k+ 2 2 k+2 1 +k2dk +2 d t t d k S 1= 1 k+ 2 (k+1 t +(k2 +k)d )2 1 S 1= k+ 2 k+1 S 1= 2 d ( t1 +k ) k+ 2 QED. Example 4: Prove by induction that the partial sum formula for an geometric series is true for all

positive integers n, that is S 1 = n

n t 1r) ( 1r