Solution to State and prove Pascal’s identity using the formula for {n \choose k}( k n ​ … - Sikademy
Author Image

Archangel Macsika

State and prove Pascal’s identity using the formula for {n \choose k}( k n ​ )

The Answer to the Question
is below this banner.

Can't find a solution anywhere?

NEED A FAST ANSWER TO ANY QUESTION OR ASSIGNMENT?

Get the Answers Now!

You will get a detailed answer to your question or assignment in the shortest time possible.

Here's the Solution to this Question

Pascal's identity states that {n \choose k} = {n-1 \choose k-1}+{n-1 \choose k}, where {n \choose k}={\frac{n!} {(n-k)!*k!}}

{n-1 \choose k-1}+{n-1 \choose k}= {\frac{(n-1)!} {(n-1-k+1)!*(k-1)!}}+{\frac{(n-1)!} {(n-1-k)!*k!}}={\frac{(n-1)!} {(n-k)!*(k-1)!}}+{\frac{(n-1)!} {(n-k-1)!*k!}}={\frac{k*(n-1)!+(n-k)*(n-1)!} {(n-k)!*k!}}={\frac{k*(n-1)!+n*(n-1)!-k*(n-1)!} {(n-k)!*k!}}={\frac{n!} {(n-k)!*k!}}

The statement has been proven

Related Answers

Was this answer helpful?

Join our Community to stay in the know

Get updates for similar and other helpful Answers

Question ID: mtid-5-stid-8-sqid-1125-qpid-863