Thursday

April 24, 2014

April 24, 2014

Posted by **Bob** on Tuesday, June 18, 2013 at 10:54am.

- Math -
**Count Iblis**, Tuesday, June 18, 2013 at 11:26amEach permutation can be decomposed in terms of cyclical permutations. The GCM of the cycle lengths is the number of times you need to apply the permutation to get the same result back. This number is, of course, different for each permutation, so we need to find the LCM of these numbers taken over all the permutations.

This is then a LCM of a set of LCM of cycle lengths, so we can just consider all possible cycle lengths and take the LCM of these. This is clearly the product of all the prime numbers smaller or equal to 8, which is 2*3*5*7 = 210, so the least number of times you need to apply the permutation to be guaranteed that you to get the original configuration is 209.

- Math -
**Bob**, Tuesday, June 18, 2013 at 11:28amThanks

- Math -
**best**, Tuesday, June 18, 2013 at 11:25pmbut 209 is incorrect

**Related Questions**

Math - γ is a permutation on eight elements, though you are not told which ...

Math - γ is a permutation on eight elements, though you are not told which ...

Probability - Consider an RV X with the following density given parameters α...

Algebra 2 - What is the determinant of -2 -3 5 0 15 How you get 15 Use the ...

math - the inverse cosine of negative 0.947 Put it in your calculator... The ...

math - The roots of the polynomial f(x)=2x3+20x2+201x+2013 are α,β and...

Nuclear Chemistry - The half- life of a positron is very short. it reacts with ...

Math - the vector u makes angles α(alpha), β(beta), γ(gama) with ...

math - For the set X={m,n.p,q,r,s}, let R be the relation on P(X) (power set) ...

Math - If there are 6 elements in ( A u B ) and 1 element in ( A n B ) answer ...