Not signed in (Sign In)

Not signed in

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

  • Sign in using OpenID

Discussion Tag Cloud

Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.

Welcome to nForum
If you want to take part in these discussions either sign in now (if you have an account), apply for one now (if you don't).
    • CommentRowNumber1.
    • CommentAuthorUrs
    • CommentTimeJan 16th 2018
    • (edited Jan 16th 2018)

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

    • CommentRowNumber2.
    • CommentAuthorzskoda
    • CommentTimeJan 19th 2018
    • (edited Jan 19th 2018)

    I added

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

    The same for binomial/multinomial coefficients, the numbers k ik_i and nn can be zero as it is in Pascal triangle, then one uses 0!=10! = 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.

    • CommentRowNumber3.
    • CommentAuthorTodd_Trimble
    • CommentTimeJan 19th 2018

    Added the justification via counting the number of permutations.