Permutations without repetition
Let us suppose a finite set A is given. The permutation of the elements of set A is any sequence that can be formed from its elements.
The number of permutations is:
P_{n}=n! (n factorial), where n is the number of elements of the set.
Given three people {Michael, Peter, Rose}, the following is the set of all permutations of that set:
Enter the number of elements of the set A and the computer will calculate you how many permutations without repetition of the elements are there?
