Let Z n denote the set of all positive integers less than or equal to an integer n , and let σ denote a permutation of Z n .
What is the maximum value of k such that there exists a permutation σ defined on Z 1 0 , for which σ k ( Z 1 0 ) = Z 1 0 , but σ i ( Z 1 0 ) = Z 1 0 , ∀ 1 < i < k
Note : Here
f ( S ) = S means that f ( x ) = x , ∀ x ∈ S .
f ( S ) = S means that f ( x ) = x is NOT satisfied for at least one element x ∈ S .
σ m ( S ) = m times σ ∘ σ ∘ ⋯ ∘ σ ( S )
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.
Thanks for the link @Agnishom Chattopadhyay . I figured the logic and was sure that there would be an associated series, but could not search it.
Can you provide a more detailed solution or relevant material?
Also see: A000793
Thanks., but I was looking for an explanation of the solution (and question too). It'd be better if you provide link to some material on the topic or much simply, just provide name of terms and topics regarding this. I'd google them.
Log in to reply
Look up Symmetry Group and Permutations
can you clarify the first 2 sentences? thanks!!!
Problem Loading...
Note Loading...
Set Loading...
The maximum value of k would happen if the permutation is composed of sub-cycles of length c 1 , c 2 , ⋯ , c m such that c 1 + c 2 + ⋯ + c m = 1 0 and k = L C M ( c 1 , c 2 , ⋯ , c m ) is maximized.
This occurs when there are three sub-cycles of length 2 , 3 , 5 in the permutation, making k = 3 0 .
An example of such a permutation
σ = ( 1 2 2 1 3 4 4 5 5 3 6 1 0 7 6 8 7 9 8 1 0 9 )