Skip to content
← All questions

Why does dividing the permutation count by r! yield the number of unordered r-item groups?

Dividing the permutation count by r!r! yields the number of unordered groups because each specific set of rr items can be arranged in r!r! different orders. Since combinations ignore internal order, all r!r! permutations of a single group correspond to just one combination. Therefore, to count unique groups, we must divide the total ordered arrangements by the number of redundant orderings per group.

Conditions

  • The selection is without repetition.
  • The items are distinct.
  • We are converting from ordered selections (permutations) to unordered selections (combinations).

Reasoning, step by step

  1. Start with the count of ordered r-item selections (permutations).
  2. Recognize that any specific group of r items has r! internal orderings.
  3. Understand that these r! orderings are counted separately in the permutation formula.
  4. Divide the permutation count by r! to collapse these redundant orderings into a single unordered group.
  5. The result is the number of combinations, n!/[r!(n−r)!]n!/[r!(n-r)!].

Example

Each unordered r-item group appears r! times among its orderings. Dividing the permutation count by r! gives n!/[r!(n−rn-r)!].

Common misconceptions

  • Thinking that r! represents the number of items selected.
  • Believing that division is only necessary when items are repeated.
  • Confusing the role of r! in permutations versus combinations.

Watch the explanation

Connected concepts

Explore next

Related questions

Meet the concept

↗
Find a method

↗
Meet the concept

↗

Answers are generated from source material and independently checked. Consult the original video or creator if something is unclear.