Question
Show that $\left( \begin{array}{c}{n} \\ {k}\end{array}\right)=\left( \begin{array}{c}{n} \\ {n-k}\end{array}\right) .$ Give an interpretation involving subsets.
Step 1
Mathematically, this is represented as: \[ \left( \begin{array}{c}{n} \\ {k}\end{array}\right) = \frac{n!}{k!(n-k)!} \] Show more…
Show all steps
Your feedback will help us improve your experience
Robin Corrigan and 94 other Intro Stats / AP Statistics educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Show that n n ( ) = ( ). k n - k Give an interpretation involving subsets.
Prove that all sets with $n$ elements have $2^{\prime \prime}$ subsets. Count the empty set $\empty set$ and the whole set as subsets.
Precalculus Preview
A Note on Mathematical Proof; Mathematical Induction
Give a combinatorial argument to show that $$C(n, k)=C(n, n-k)$$
Counting Methods and the Pigeonhole Principle
Binomial Coefficients and Combinatorial Identities
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD