PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
[parent] Pascal's rule proof (Proof)

We need to show \begin{eqnarray*} \binom{n}{k} + \binom{n}{k-1} & = & \binom{n+1}{k} \end{eqnarray*}Let us begin by writing the left-hand side as $$ \frac{n!}{k!(n-k)!} + \frac{n!}{(k-1)!(n-(k-1))!}$$ Getting a common denominator and simplifying, we have \begin{eqnarray*} \frac{n!}{k!(n-k)!} + \frac{n!}{(k-1)!(n-k+1)!} & = & \frac{(n-k+1)n!}{(n-k+1)k!(n-k)!}+\frac{kn!}{k(k-1)!(n-k+1)!} \\ & = & \frac{(n-k+1)n!+kn!}{k!(n-k+1)!} \\ & = & \frac{(n+1)n!}{k!((n+1)-k)!} \\ & = & \frac{(n+1)!}{k!((n+1)-k)!} \\ & = & \binom{n+1}{k} \end{eqnarray*}



"Pascal's rule proof" is owned by akrowne.
(view preamble | get metadata)

View style:


This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: denominator, side

This is version 5 of Pascal's rule proof, born on 2001-10-16, modified 2002-02-19.
Object id is 259, canonical name is PascalsRuleProof.
Accessed 6324 times total.

Classification:
AMS MSC05A10 (Combinatorics :: Enumerative combinatorics :: Factorials, binomial coefficients, combinatorial functions)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add example | add (any)