Precalculus: Mathematics for Calculus, 7th Edition

Published by Brooks Cole
ISBN 10: 1305071751
ISBN 13: 978-1-30507-175-9

Chapter 12 - Section 12.6 - The Binomial Theorem - 12.6 Exercises - Page 887: 54

Answer

See explanations.

Work Step by Step

Step 1. Prove the statement is true for $n=1$: test for $r=0,1$ $\begin{pmatrix} 1\\0 \end{pmatrix}=\frac{1}{0!(1-0)!}=1$ which is an integer. $\begin{pmatrix} 1\\1 \end{pmatrix}=\frac{1}{1!(1-1)!}=1$ which is an integer. Step 2. Assume the statement is true for $n=k$: $\begin{pmatrix} k\\r \end{pmatrix}$ is an integer for all $0\leq r\leq k$. Step 3. Prove that it is true for $n=k+1$: (use the results from Exercise 53) $\begin{pmatrix} k+1\\r \end{pmatrix}=\begin{pmatrix} k\\r \end{pmatrix}+\begin{pmatrix} k\\r-1 \end{pmatrix}=integer_1 + integer_2=integer_3$ Step 4. With mathematical induction, we proved that the statement is true for all n,
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.