Combinatorics Through Guided Discovery, 2004a
Combinatorics Through Guided Discovery, 2004a
Combinatorics Through Guided Discovery, 2004a
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
2.1. Some Examples of Mathematical Induction 33<br />
You will find some explicit examples of the use of the strong principle of mathematical<br />
induction in Appendix B and will find some uses for it in this chapter.<br />
2.1.2 Binomial Coefficients and the Binomial Theorem<br />
• Problem 72. When we studied the Pascal Equation and subsets in Chapter 1,<br />
it may have appeared that there is no connection between the Pascal relation<br />
( n k ) = (n−1 k−1 ) + (n−1 k ) and the formula (n k ) = n! . Of course you probably<br />
k!(n−k)!<br />
realize you can prove the Pascal relation by substituting the values the<br />
formula gives you into the right-hand side of the equation and simplifying<br />
to give you the left hand side. In fact, from the Pascal Relation and the facts<br />
that ( n 0 ) =1and (n n ) =1, you can actually prove the formula for (n k ) by<br />
induction on n. Do so. (h)<br />
⇒ Problem 73. Use the fact that (x + y) n = (x + y)(x + y) n−1 to give an<br />
inductive proof of the binomial theorem. (h)<br />
Problem 74. Suppose that f is a function defined on the nonnegative integers<br />
such that f (0) = 3 and f (n) =2f (n − 1). Find a formula for f (n) and<br />
prove your formula is correct.<br />
Problem 75. Prove the conjecture in Part 13.b for an arbitrary positive integer<br />
m without appealing to the general product principle. (h)<br />
2.1.3 Inductive definition<br />
You may have seen n! described by the two equations 0!=1and n! =n(n − 1)!<br />
for n > 0. By the principle of mathematical induction we know that this pair of<br />
equations defines n! for all nonnegative numbers n. For this reason we call such<br />
a definition an inductive definition. An inductive definition is sometimes called<br />
a recursive definition. Often we can get very easy proofs of useful facts by using<br />
inductive definitions.<br />
⇒<br />
Problem 76. An inductive definition of a n for nonnegative n is given by<br />
a 0 =1and a n = aa n−1 . (Notice the similarity to the inductive definition of<br />
n!.) We remarked above that inductive definitions often give us easy proofs<br />
of useful facts. Here we apply this inductive definition to prove two useful<br />
facts about exponents that you have been using almost since you learned<br />
the meaning of exponents.