Chapter 6: Q28SE (page 440)
Prove using mathematical induction that \(\sum\limits_{j = 2}^n C (j,2) = C(n + 1,3)\) whenever \(n\) is an integer greater than\(1\).
Short Answer
Use a proof by induction.
Chapter 6: Q28SE (page 440)
Prove using mathematical induction that \(\sum\limits_{j = 2}^n C (j,2) = C(n + 1,3)\) whenever \(n\) is an integer greater than\(1\).
Use a proof by induction.
All the tools & learning materials you need for study success - in one app.
Get started for free5. How many ways are there to assign three jobs to five employees if each employee can be given more than one job?
a) State the binomial theorem.
b) Explain how to prove the binomial theorem using a combinatorial argument.
c) Find the coefficient ofin the expansion of.
Find the coefficient of.
How many solutions are there to the equation x1 + x2 + x3 + x4 + x5 = 21,
where xi, i = 1, 2, 3, 4, 5, is a nonnegative integer such that
a) x1 โฅ 1?
b) xi โฅ 2 for i = 1, 2, 3, 4, 5?
c) 0 โค x1 โค 10?
d) 0 โค x1 โค 3, 1 โค x2 < 4, and x3 โฅ 15?
Prove that if\(n\)and\(k\)are integers with\(1 \le k \le n\), then\(k \cdot \left( {\begin{array}{*{20}{l}}n\\k\end{array}} \right) = n \cdot \left( {\begin{array}{*{20}{l}}{n - 1}\\{k - 1}\end{array}} \right)\),
a) using a combinatorial proof. [Hint: Show that the two sides of the identity count the number of ways to select a subset with\(k\)elements from a set with n elements and then an element of this subset.]
b) using an algebraic proof based on the formula for\(\left( {\begin{array}{*{20}{l}}n\\r\end{array}} \right)\)given in Theorem\(2\)in Section\(6.3\).
What do you think about this solution?
We value your feedback to improve our textbook solutions.