Permutations without repetition n=64 result

The calculator computes the number of permutations of n elements. The 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 repetitions are not allowed. There are n! (n factorial) ways of arranging n objects into an ordered sequence.

(n)

Calculation:

P(n)=n!  n=64 P(64)=64!=1.2688693218588×1089

The number of permutations: 1.2688693218588×1089

126886932185884164103433389335
161480802865516174545192198801894375214704230400000000000000


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 »