An algebra problem

Algebra Level 3

Let S = { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 } S=\left\{ 1,2,3,4,5,6,7,8,9 \right\} . Consider a function f : S S f:S\rightarrow S defined in the following table:

x f ( x ) 1 8 2 3 3 5 4 7 5 2 6 9 7 6 8 1 9 4 \begin{array} { | c | c | } \hline x & f(x) \\ \hline 1 & 8 \\ 2 & 3 \\ 3 & 5 \\ 4 & 7 \\ 5 & 2 \\ 6 & 9 \\ 7 & 6 \\ 8 & 1 \\ 9 & 4 \\ \hline \end{array}

Then, the minimum integer value of n n such that f ( f ( . . . ( f ( x ) ) ) = x \underbrace { f(f(...(f } (x)))=x \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad n n times

for every x S x\in S is...


Source : 1st round of third level 2013 Brazilian Mathematics Olympiad(OBM).
4 6 5 24 12

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Otto Bretscher
Apr 10, 2016

The given permutation consists of 3 disjoint cycles, 18, 235, and 4769. The order of the permutation is the least common multiple of the lengths of these cycles, which is 12 \boxed{12}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...