Sample Induction Proofs

Transcription

1 Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given illustrate all of the main types of induction situations that you may encounter and that you should be able to handle. Use these solutions as models for your writing up your own solutions in exams and homework. For additional examples, see the following examples and exercises in the Rosen text: Section 4., Examples 0, Exercises 3, 5, 7, 3, 5, 9,, 3, 5, 45. Section 4.3, Example 6, Exercises 3, 5.. Prove by induction that, for all n Z +, n ( )i i = ( ) n n(n + )/. () n ( ) i i = ( )n n(n + ). Base case: When n =, the left side of () is ( ) =, and the right side is ( )(+)/ =, so both sides are equal and () is true for n =. Induction step: Let k Z + be given and suppose () is true for n = k. Then ( ) i i = ( ) i i + ( ) (k + ) = ( )k k(k + ) = ( )k (k + ) + ( ) (k + ) (by induction hypothesis) (k (k + )) = ( )k (k + ) ( k ) = ( ) (k + ). Thus, () holds for n = k +, and the proof of the induction step is complete. Conclusion: By the principle of induction, () is true for all n Z +.. Find and prove by induction a formula for n i(i+), where n Z +. () n i(i + ) = n n +. Base case: When n =, the left side of () is /( ) = /, and the right side is /, so both sides are equal and () is true for n =.

2 Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Induction step: Let k Z + be given and suppose () is true for n = k. Then i(i + ) = i(i + ) + (k + )(k + ) = k k + + (by induction hypothesis) (k + )(k + ) k(k + ) + = (by algebra) (k + )(k + ) (k + ) = (k + )(k + ) = k + k +. (by algebra) Thus, () holds for n = k +, and the proof of the induction step is complete. Conclusion: By the principle of induction, () is true for all n Z Find and prove by induction a formula for n n Z +. (i ) (i.e., the sum of the first n odd numbers), where () n (i ) = n. Base case: When n =, the left side of () is, and the right side is =, so both sides are equal and () is true for n =. Induction step: Let k Z + be given and suppose () is true for n = k. Then (i ) = (i ) + ((k + ) ) = k + (k + ) (by induction hypothesis) = k + k + = (k + ). Thus, () holds for n = k +, and the proof of the induction step is complete. Conclusion: By the principle of induction, () is true for all n. 4. Find and prove by induction a formula for n i= ( i ), where n Z + and n. Proof: We will prove by induction that, for all integers n, () n ( i ) i= = n + n. Base case: When n =, the left side of () is / = 3/4, and the right side is (+)/4 = 3/4, so both sides are equal and () is true for n =.

3 Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Induction step: Let k be given and suppose () is true for n = k. Then i= ( i ) = k i= = k + k ( i ) ( ( (k + ) = k + k (k + ) (k + ) = k + k k(k + ) = k + (k + ). ) (k + ) ) (by induction hypothesis) Thus, () holds for n = k +, and the proof of the induction step is complete. Conclusion: By the principle of induction, () is true for all n Z + with n. 5. Prove that n! > n for n 4. Proof: We will prove by induction that n! > n holds for all n 4. Base case: Our base case here is the first n-value for which is claimed, i.e., n = 4. For n = 4, the left and right sides of are 4 and 6, respectively, so is true in this case. Induction step: Let k 4 be given and suppose is true for n = k. Then (k + )! = k!(k + ) > k (k + ) (by induction hypothesis) k (since k 4 and so k + )) =. Thus, holds for n = k +, and the proof of the induction step is complete. Conclusion: By the principle of induction, it follows that is true for all n Prove that for any real number x > and any positive integer x, ( + x) n + nx. Proof: Let x be a real number in the range given, namely x >. We will prove by induction that for any positive integer n, ( + x) n + nx. holds for any n Z +. Base case: For n =, the left and right sides of are both + x, so holds. Induction step: Let k Z + be given and suppose is true for n = k. We have ( + x) = ( + x) k ( + x) ( + kx)( + x) (by ind. hyp. and since x > and thus ( + x) > 0) = + (k + )x + kx (by algebra) + (k + )x (since kx 0). Hence holds for n = k +, and the proof of the induction step is complete. Conclusion: By the principle of induction, it follows that holds for all n Z +. 3

4 Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand 7. Prove that n f i = f nf n+ for all n Z +. Proof: We seek to show that, for all n Z +, n fi = f n f n+. Base case: When n =, the left side of is f =, and the right side is f f = =, so both sides are equal and is true for n =. Induction step: Let k Z + be given and suppose is true for n = k. Then fi = fi + f = f k f + f (by ind. hyp. with n = k) = f (f k + f ) (by algebra) = f f k+ (by recurrence for f n ). Thus, holds for n = k +, and the proof of the induction step is complete. Conclusion: By the principle of induction, it follows that is true for all n Z Prove that f n (3/) n for all n Z +. Proof: We will show that for all n Z +, f n (3/) n Base cases: When n =, the left side of is f =, and the right side is (3/) = /3, so holds for n =. When n =, the left side of is f =, and the right side is (3/) 0 =, so both sides are equal and is true for n =. Thus, holds for n = and n =. Induction step: Let k be given and suppose is true for all n =,,..., k. Then f = f k + f k (by recurrence for f n ) (3/) k + (3/) k 3 (by induction hypothesis with n = k and n = k ) = (3/) k ( (3/) + (3/) ) (by algebra) ( = (3/) k ) 9 = (3/) k 0 9 > (3/)k. Thus, holds for n = k +, and the proof of the induction step is complete. Conclusion: By the principle of strong induction, it follows that is true for all n Z +. Remarks: Number of base cases: Since the induction step involves the cases n = k and n = k, we can carry out this step only for values k (for k =, k would be 0 and out of range). This in turn forces us to include the cases n = and n = in the base step. Such multiple bases cases are typical in proofs involving recurrence sequences. For a three term recurrence we would need to check three initial cases, n =,, 3, and in the induction step restrict k to values 3 or greater. 9. Prove that n f i = f n+ for all n Z +. 4

5 Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand n f i = f n+. Base case: When n =, the left side of is f =, and the right side is f 3 = =, so both sides are equal and is true for n =. Induction step: Let k Z + be given and suppose is true for n = k. Then f i = f i + f = f k+ + f (by ind. hyp. with n = k) = f k+3 (by recurrence for f n ) Thus, holds for n = k +, and the proof of the induction step is complete. Conclusion: By the principle of induction, it follows that is true for all n Z +. Remark: Here standard induction was sufficient, since we were able to relate the n = k + case directly to the n = k case, in the same way as in the induction proofs for summation formulas like n i = n(n + )/. Hence, a single base case was sufficient. 0. Let the Tribonacci sequence be defined by T = T = T 3 = and T n = T n + T n + T n 3 for n 4. Prove that T n < n for all n Z +. Proof: We will prove by strong induction that, for all n Z +, T n < n Base case: We will need to check directly for n =,, 3 since the induction step (below) is only valid when k 3. For n =,, 3, T n is equal to, whereas the right-hand side of is equal to =, = 4, and 3 = 8, respectively. Thus, holds for n =,, 3. Induction step: Let k 3 be given and suppose is true for all n =,,..., k. Then T = T k + T k + T k (by recurrence for T n ) < k + k + k (by strong ind. hyp. with n = k, k, and k ) ( = ) 8 = 7 8 <. Thus, holds for n = k +, and the proof of the induction step is complete. Conclusion: By the principle of strong induction, it follows that is true for all n Z +.. Let a n be the sequence defined by a =, a = 8, a n = a n + a n (n 3). Prove that a n = 3 n + ( ) n for all n Z +. Proof: We will prove by strong induction that, for all n Z +, a n = 3 n + ( ) n. Base case: When n =, the left side of is a =, and the right side is ( ) =, so both sides are equal and is true for n =. 5

6 Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand When n =, the left and right sides of are a = 8 and 3 + ( ) = 8, so holds in this case as well. Induction step: Let k Z + with k be given and suppose is true for n =,,..., k. Then a = a k + a k (by recurrence for a n ) = 3 k + ( ) k + ( 3 k + ( ) k ) (by for n = k and n = k ) = 3 ( k + k ) + ( ( ) k + ( ) k ) (by algebra) = 3 k + ( ) (more algebra). Thus, holds for n = k +, and the proof of the induction step is complete. Conclusion: By the strong induction principle, it follows that is true for all n Z +.. Number of subsets: Show that a set of n elements has n subsets. Proof: P (n) We will prove by induction that, for all n Z +, the following holds: Any set of n elements has n subsets. Base case: Since any -element set has subsets, namely the empty set and the set itself, and =, the statement P (n) is true for n =. Induction step: Let k Z + be given and suppose P (k) is true, i.e., that any k-element set has k subsets. We seek to show that P (k + ) is true as well, i.e., that any (k + )-element set has subsets. Let A be a set with (k + ) elements. Let a be an element of A, and let A = A {a} (so that A is a set with k elements). We classify the subsets of A into two types: (I) subsets that do not contain a, and (II) subsets that do contain a. The subsets of type (I) are exactly the subsets of the set A. Since A has k elements, the induction hypothesis can be applied to this set and we get that there are k subsets of type (I). The subsets of type (II) are exactly the sets of the form B = B {a}, where B is a subset of A. By the induction hypothesis there are k such sets B, and hence k subsets of type (II). Since there are k subsets of each of the two types, the total number of subsets of A is k + k =. Since A was an arbitrary (k + )-element set, we have proved that any (k + )-element set has subsets. Thus P (k + ) is true, completing the induction step. Conclusion: By the principle of induction, P (n) is true for all n Z Number of -element subsets: Show that a set of n elements has n(n )/ subsets with elements. (Take n = as the base case.) Proof: (Sketch) This can be proved in the same way as the formula for the number of all subsets. For the number of Type I subsets (i.e., those not containing the element a), the induction hypothesis can be used as before. The Type II subsets of A can be counted directly: the latter subsets are those of the form {a, b}, where a is the selected element and b is an arbitrary element in A {a}. There are k choices for b, and hence k subsets of Type II. 4. Generalization of De Morgan s Law to unions of n sets. Show that if A,..., A n are sets, then (A A n ) = A A n. 6

7 Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Proof: P (n): We seek to prove by induction on n the following statement: For all sets A,..., A n we have (A A n ) = A A n. The key to the argument is two set version of De Morgan s Law: ( ) (A B) = A B, which holds for any sets A and B. Base case: For n =, the left and right sides of are both equal to A, so holds trivially in this case. Hence P () is true. Though not absolutely necessary, we can also easily verify the next case, n = : In this case, the left and right sides of are (A A ) and A A, respectively, so the identity is just the two set version of De Morgan s Law, i.e., ( ) with A = A and B = A. Induction step: Let k, and suppose P (k) is true, i.e., suppose that holds for n = k and any sets A,..., A k. We seek to show that P (k + ) is true, i.e., that for any sets A,..., A, holds. Let A,..., A be given sets. Then (A A ) = ((A A k ) A ) = (A A k ) A (by ( ) with A = (A A k ) and B = A ) = ( A A k ) A (by induction hypothesis applied to A,..., A k ) = A A k A. Thus, holds for n = k +, and since the A,..., A were arbitrary sets, we have obtained statement P (k + ). Hence, the proof of the induction step is complete. Conclusion: By the principle of induction, it follows that P (n) is true for all n Z +. 7