Variations without repetition

V_n^k=\dfrac{n!}{(n-k)!}

Result unit: — (liczba)

What it describes

The number of k-element sequences chosen from n elements (order matters, no repetition).

n

number of elements

k

length of the selection

We choose k elements from n keeping order and without repetition — like awarding medals (who is first, second, third).

Ordered selection without repetition (medals, codes without repeated symbols).

How many ordered triples can be formed from 5 elements (no repetition)?

Substitution

n=5

k=3

Result

V=\dfrac{5!}{2!}=60

Found this formula useful? Share it.

It's free — send it to a friend who's revising.

Teaching? Embed this formula on your site.

Free widget — paste it on your school site, blog or notes. It links to the full version.