View source

== Problem ==
(''storyline deleted'') Let <math>k</math> be the number of students in a circle. Then let <math>m</math> be the number of ways they can rearrange ourselves so that each of them is in the same spot or within one spot of where they started, and no two people are ever on the same spot. If <math>m</math> leaves a remainder of <math>1</math> when divided by <math>5</math>, how many possible values are there of <math>k</math>, where <math>k</math> is at least <math>3</math> and at most <math>2008</math>?

== Solution ==
We first consider the following related problem: How many ways are there to rearranged <math>n</math> students in a line, where each student can either not move or move to one spot of where that student srated? Let <math>L_n</math> be the number of ways to do so with <math>n</math> students. Then, if we add a <math>n+1</math>st student at the right end, that student can either stay still, for which the number of rearrangements is simply the number of rearrangements for the other <math>n</math> students (or <math>L_n</math>); or that student can move one spot to the left, in which case the second rightmost student must move to the right end, and there are <math>L_{n-1}</math> ways to rearrange the remaining <math>n-1</math> students. Thus, we have the recursion 

<cmath>L_{n+1} = L_n + L_{n-1}</cmath>

and <math>L_1 = 1, L_2 = 2</math>. Hence <math>L_n = F_{n-1}</math> where <math>F_n</math> is the [[Fibonacci sequence]], defined with <math>F_1 = F_2 = 1</math>. 


Returning to the original problem, suppose we have <math>n</math> students arranged in a circle. We now add a <math>n+1</math>th student anywhere in the circle. If that student remains still, then there are simply <math>L_n</math> ways to rearrange the other <math>n</math> student (as the two students next to this student cannot move beyond the student). If the student exchanges spots with one of his adjacent neighbors (of which there are <math>2</math>), the remaining <math>n-1</math> students can be rearranged in <math>2L_{n-1}</math> ways. Finally, if all of the students shift to their left or right, there are two ways. Hence, the number of ways to rearrange <math>n</math> students is <math>C_n = L_n + 2L_{n-1} + 2 = F_{n-1} + 2F_{n-2} + 2</math>. 

Then, <math>C_n</math> itself satisfies the recursion <math>C_{n+1} = F_{n} + 2F_{n-1} + 2</math> <math>= (F_{n-1} + 2F_{n-2} + 2) + (F_{n-2} + 2F_{n-3} + 2) - 2</math> <math>= C_{n} + C_{n-1} - 2</math>, with <math>C_3 = 6, C_4 = 9</math>. Then <math>C_n</math> cycles <math>\mod{5}</math> as <math>\{C_n\} \equiv 1,4,3,0,1,4 \cdots \pmod{5}</math>, so we require that <math>k \equiv 3 \pmod{4}</math>. There are <math>\boxed{502}</math> such values from <math>3 \le k \le 2008</math>.

== See also ==

[[Category:Olympiad Combinatorics Problems]]