Chapter 9: Problem 48
Find \(\left(\begin{array}{c}{n} \\\ {k-1}\end{array}\right)+\left(\begin{array}{c}{n} \\ {k}\end{array}\right)\) and write the answer as a binomial coefficient in the form \(\left(\begin{array}{l}{n} \\ {k}\end{array}\right)\) Prove it. Hint Use the fact that, for any integer \(p,\) such that \(p \geq 1\) \(p !=p(p-1) !\).
Short Answer
Step by step solution
Understanding Binomial Coefficients
Writing Down the Expression
Finding a Common Denominator
Rewriting the Terms with a Common Denominator
Adding the Terms
Simplifying the Expression
Conclusion
Unlock Step-by-Step Solutions & Ace Your Exams!
-
Full Textbook Solutions
Get detailed explanations and key concepts
-
Unlimited Al creation
Al flashcards, explanations, exams and more...
-
Ads-free access
To over 500 millions flashcards
-
Money-back guarantee
We refund you if you fail your exam.
Over 30 million students worldwide already upgrade their learning with 91Ó°ÊÓ!
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
Factorial
- \(n! = n \times (n-1) \times (n-2) \times \ldots \times 1\)
Combinatorial Principle
Common Denominator
- \(\binom{n}{k-1} = \frac{n!}{(k-1)!(n-k+1)!}\)
- \(\binom{n}{k} = \frac{n!}{k!(n-k)!}\)
Algebraic Simplification
- Original numerator: \(k + n - k + 1 = n + 1\)