Jump to content

Finite permutation/Cycle length/Elements/Exercise

From Wikiversity

We consider the permutation F on

M={1,2,…,8}

given by

x 1 2 3 4 5 6 7 8
F(x) 3 5 1 7 8 2 6 4
  1. Establish a value table for F2=F∘F.
  2. Establish a value table for F3=F∘F∘F.
  3. Show that all iterated compositions Fn are bijective.
  4. Determine, for every x∈M, the minimal n∈ℕ+ such that
    Fn(x)=x

    holds.

  5. Determine the minimal n∈ℕ+ such that
    Fn(x)=x

    holds for all x∈M.