Not signed in

Want to take part in these discussions? Sign in if you have an account, or apply for one below

• Forgot your password?
• Apply for membership

1. • CommentRowNumber1.
   • CommentAuthorUrs
   • CommentTimeJan 16th 2018
   • (edited Jan 16th 2018)
   • PermaLink
   Author: Urs
   Format: MarkdownItexI had occasion to create minimal entries for basic combinatorial concepts: _[[factorial]]_, _[[multinomial coefficient]]_

   I had occasion to create minimal entries for basic combinatorial concepts: factorial, multinomial coefficient

2. • CommentRowNumber2.
   • CommentAuthorzskoda
   • CommentTimeJan 19th 2018
   • (edited Jan 19th 2018)
   • PermaLink
   Author: zskoda
   Format: MarkdownItexI added > In [[combinatorics]], the definition usually extends to $k = 0$ by setting $0! = 1$. The same for binomial/multinomial coefficients, the numbers $k_i$ and $n$ can be zero as it is in Pascal triangle, then one uses $0! = 1$. (In fact, there are also the standard conventions when some of the numbers are out of bound when the multinomial coefficients are, in combinatorics, taken to be zero.) Our entry [[binomial theorem]] anyway uses the summation where the lower index is allowed to be zero as it should be.

   I added

   In combinatorics, the definition usually extends to $k = 0$ by setting $0! = 1$.

   The same for binomial/multinomial coefficients, the numbers $k_i$ and $n$ can be zero as it is in Pascal triangle, then one uses $0! = 1$. (In fact, there are also the standard conventions when some of the numbers are out of bound when the multinomial coefficients are, in combinatorics, taken to be zero.) Our entry binomial theorem anyway uses the summation where the lower index is allowed to be zero as it should be.

3. • CommentRowNumber3.
   • CommentAuthorTodd_Trimble
   • CommentTimeJan 19th 2018
   • PermaLink
   Author: Todd_Trimble
   Format: MarkdownItexAdded the justification via counting the number of permutations.

   Added the justification via counting the number of permutations.