Difference between revisions of "NCr"
From Maths
(Created page with "{{DISPLAYTITLE:nCr}}{{Stub page|grade=A|msg=I'd like this page to be better, "" for Combinations and what is noted there. ~~~~}} __TOC__ ==Definition== {{M|n}}-choose-{{M|...") |
m (Categorising and adding references/notes section) |
||
Line 13: | Line 13: | ||
* [[nPr]] - the same concept but for number of [[permutations]] instead. | * [[nPr]] - the same concept but for number of [[permutations]] instead. | ||
* [[Pascal's triangle]] | * [[Pascal's triangle]] | ||
+ | ==Notes== | ||
+ | <references group="Note"/> | ||
+ | ==References== | ||
+ | <references/> | ||
+ | {{Definition|Combinatorics}} |
Latest revision as of 16:39, 14 April 2018
Stub grade: A
This page is a stub
This page is a stub, so it contains little or minimal information and is on a to-do list for being expanded.The message provided is:
I'd like this page to be better, "" for Combinations and what is noted there. Alec (talk) 16:38, 14 April 2018 (UTC)
Contents
[hide]Definition
n-choose-r is the number of ways to choose r items from n items, said differently it's the number of distinct combinations of length r we can make from n items.
- nCr(n,r):=n!r!(n−r)!
Notation
I write and prefer something like: nCr - but I've never gotten this to work well in LaTeX.
I've also seen (nr) used, but more compact (vertically) than this vector.
Properties
- nCr(n,r)=nCr(n,n−r)
See also
- nPr - the same concept but for number of permutations instead.
- Pascal's triangle