This document discusses cyclic permutation and provides examples of solving cyclic permutation problems. It defines cyclic permutation as arranging distinct objects around a fixed circle. The number of permutations when arranging n distinct objects in a circle is (n-1)!. It also provides the formula for arranging objects on a key ring or bracelet as (n-1)!/2. The document gives several examples of solving cyclic permutation problems and directs the reader to solve additional problems showing their work.