Professional Documents
Culture Documents
0.1 Permutation
Definition. Let X be a set with n elements (n 1) . Permutation of an n-element set X
is an (ordered) arrangement of all n elements from X (without repetition).
Example. The permutations of the set X = {a, b, c} are (a, b, c), (a, c, b), (b, a, c),
(b, c, a), (c, a, b), (c, b, a).
Number of permutations. The number of permutations of an n-element set, written
Pn , is
Pn = n!
(!: factorial)
Example. The set X = {a, b, c} has 3! = 6 permutations.
0.2 Arrangement without repetition (k-permutation)
Definition. Let X be a set with n elements and an integer k with 1 k n . A k-
permutation from a set X is an ordered arrangement of k elements from an n-element
set X (without repetition)
The number of k-permutations of an n-element set, written Ank , is
1
Lecturer: Nguyen Duong Nguyen Mathematics Department, Faculty of Basic Science, FTU
b) The number of ways to establish a delegation, in which there are three men and two
women is
C36 C42 120