Ask your own question, for FREE!
Mathematics 17 Online
OpenStudy (anonymous):

Simplification of Choose Functions

OpenStudy (anonymous):

How do I simplify the LHS to be the RHS? \[\left(\begin{matrix}x \\ n\end{matrix}\right)-\left(\begin{matrix}x-1 \\ n\end{matrix}\right)=\left(\begin{matrix}x-1 \\ n-1\end{matrix}\right)\] I tried expanding into its factorial equivalents, but can't make progress from there.

OpenStudy (anonymous):

is this algebra 2

OpenStudy (anonymous):

No, this is probability/combinatorics theory.

OpenStudy (anonymous):

Nevermind, it follows from the recursive definition of binomial coefficients. Namely, \[{n \choose k}={n-1 \choose k-1}+{n-1 \choose k}\quad\text{for all integers n,k>0} \]

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!