Skip to content
← All questions

What is the formula for the number of ordered r-item selections from n distinct items without repetition?

The number of ordered r-item selections from n distinct items without repetition is given by the formula n!/(n−r)!n!/(n-r)!. This represents the product of the first r terms of the descending sequence starting from n.

Conditions

  • The items are distinct.
  • Selection is without repetition.
  • The order of selection matters.
  • rr is a non-negative integer less than or equal to nn.

Reasoning, step by step

  1. Identify the total number of distinct items, nn.
  2. Identify the number of items to select, rr.
  3. Recognize that the first choice has nn options, the second has n−1n-1, and so on.
  4. Multiply these decreasing counts: n×(n−1)×⋯×(n−r+1)n \times (n-1) \times \dots \times (n-r+1).
  5. Express this product compactly using factorials as n!/(n−r)!n!/(n-r)!.

Example

A four-letter password without repeated letters gives 26×25×24×2326\times 25\times 24\times 23 possibilities. In general, ordered r-item selections from n distinct items number n!/(n−rn-r)!.

Common misconceptions

  • Using nrn^r which allows repetition.
  • Using n!n! which assumes selecting all n items.
  • Confusing this with combinations where order does not matter.

Watch the explanation

Connected concepts

Explore next

Related questions

Understand why

↗
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.