Many counting problem can be solved by permutation.

**permutation**-

A permutation of a set distinct objects in an ordered arrangement of these object.

**combination** is also for counting unordered selection of object.

Last modified on 3 January 2010, at 18:40
# Projective Geometry/Classic/Projective Transformations/Transformations of projective 3-space/Permutation

Many counting problem can be solved by permutation.

**permutation**-

A permutation of a set distinct objects in an ordered arrangement of these object.

**combination** is also for counting unordered selection of object.