Let denote a function such that the table below is fulfilled.
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | |
8 | 10 | 12 | 5 | 2 | 11 | 9 | 7 | 1 | 4 | 3 | 6 |
Which of the following is true for integer ?
Bonus: Show that for any such permutation , there is an such that is the identity permutation.
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.
Note that the f n ( S ) = S if and only if n is a multiple of 4 .
In the given options, only 2 0 1 6 is divisible by 4 so f 2 0 1 6 ( S ) = S .