Talk:Circular shift
From Wikipedia, the free encyclopedia
[edit] Terminology
The article says the number of circular shifts of a set of size n is (n − 1)!. Using circular shifts in the sense used in the example, I think the number of circular shifts of a set of size n is n. Ray Spalding 01:31, 29 May 2006 (UTC)
- I removed the statement. It does not make sense because we are not talking about sets here. --Spoon! 10:20, 21 January 2007 (UTC)
[edit] Number of circular shifts
If we have N elements in set(register,variable,etc) e.g. 1 2 3 4 5 6 7 left 2 3 4 5 6 7 1, 3 4 5 6 7 1 2, 4 5 6 7 1 2 3, 5 6 7 1 2 3 4,6 7 1 2 3 4 5,7 1 2 3 4 5 6 and right 7 1 2 3 4 5 6, 6 7 1 2 3 4 5,5 6 7 1 2 3 4, 4 5 6 7 1 2 3,3 4 5 6 7 1 2,2 3 4 5 6 7 1 Its clearly seen that Nth rotation to either side(rotation are equivalent) will become the same set. So the number of possible rotations is n-1
—The preceding unsigned comment was added by 84.228.240.173 (talk) 10:41, 11 March 2007 (UTC).