Permutations without repetition

The calculator computes the number of permutations of n elements. Number of permutations is the number of ways to choose a sample of n elements from a set of n distinct objects where order does matter and repetition are not allowed. There are n! (n factorial) ways of arranging n objects into an ordered sequence.

(n)

Calculation:

Vk(n)=(nk)!n!  n=10 k=4  V4(10)=(104)!10!=6!10!=10987=5040

The number of variations: 5040



A bit of theory - the foundation of combinatorics

Permutations

A permutation is an ordered arrangement of all n elements of a set, where each element is used exactly once, the order matters, and no repetition is allowed.

P(n)=n(n1)(n2)...1=n!

Example: We have 4 books. In how many ways can we arrange them side by side on a shelf?

Foundation of combinatorics in word problems



more math problems »