Permutations without repetition n=11 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.

Elements to choose from:

(n)

Calculate

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(n-1)(n-2)...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

• N-gon
  How many diagonals does a convex 30-gon have?
• Seating rules
  In a class, there are 28 seats, but in the 5.D class, there are only 24 students. How many ways can students sit? (The class has 14 benches. A bench is for a pair of students.) Result write down as powers of 10 - (logarithm - large number).
• Coin and die
  Flip a coin and then roll a six-sided die. How many possible combinations are there?
• Peak
  Uphill leads 2 paths and one lift. a) How many options back and forth are there? b) How many options to get there and back by the not same path are there? c) How many options back and forth are there that we go at least once a lift?
• Hockey players
  After we cycle, five hockey players sit down. What is the probability that the two best scorers of this crew will sit next to each other?

more math problems »