Difference between revisions of "A choose b"
Line 21: | Line 21: | ||
<math>\frac{n!}{2!(n-2)!}=\frac{n(n+1)}{2}</math> More Simplify: | <math>\frac{n!}{2!(n-2)!}=\frac{n(n+1)}{2}</math> More Simplify: | ||
− | + | <math>\frac{n(n+1)}{2}=\frac{n(n+1)}{2}</math> | |
So now we have proved it. If you don't get what I did on the second step go to Proof Without Words on this wiki. | So now we have proved it. If you don't get what I did on the second step go to Proof Without Words on this wiki. |
Revision as of 17:08, 15 June 2019
Here is the formula for a choose b: . This is assuming that of course .
Why is it important?
a choose b counts the number of ways you can pick b things from a set of a things. For example . More at https://artofproblemsolving.com/videos/counting/chapter4/64.
a choose 2
Here is a list of n choose 2's
These are triangle numbers! My proof uses induction (assuming something is true unless proofed true or not true). Then Simplify:
More Simplify:
So now we have proved it. If you don't get what I did on the second step go to Proof Without Words on this wiki.