Combinations and Permutations

Functions > Statistics > Combinatorial Analysis > Combinations and Permutations

• combin(n, k)—Returns the number of subsets of k elements that can be formed from n elements. Each subset is known as a combination, defined as follows:

<region id="ID0ECX1BB" top="57.600000000000009" left="38.400000000000006" height="47.2" width="189.76333333333335" xmlns="http://schemas.mathsoft.com/worksheet50">
  <math resultRef="3">
    <apply xmlns="http://schemas.mathsoft.com/math50">
      <equal />
      <apply>
        <id xml:space="preserve">combin</id>
        <sequence>
          <id xml:space="preserve">n</id>
          <id xml:space="preserve">k</id>
        </sequence>
      </apply>
      <apply>
        <div />
        <apply>
          <factorial />
          <id xml:space="preserve">n</id>
        </apply>
        <apply>
          <mult />
          <apply>
            <factorial />
            <id xml:space="preserve">k</id>
          </apply>
          <apply>
            <factorial />
            <parens>
              <apply>
                <minus />
                <id xml:space="preserve">n</id>
                <id xml:space="preserve">k</id>
              </apply>
            </parens>
          </apply>
        </apply>
      </apply>
    </apply>
    <?Pub Caret -2?>
  </math>
</region>

• permut(n, k)—Returns the number of ways of ordering n distinct elements taken k at a time. Each ordered arrangement is known as a permutation, defined as follows:

Combinations and permutations are both methods of counting subsets of items, however, internal order is significant in a permutation but not in a combination. The number of combinations is usually denoted by

. The number of permutations is usually denoted by

Arguments

• n

and

k are integers greater than or equal to 0, with n ≥ k.