[math-fun] Roots-of-unity puzzle

For each n >= 2, find f(n) = the size of the largest subset of the n complex nth roots of unity that does not contain k equally spaced points for any k >= 2. (I.e., which does not contain a congruent copy of the k complex kth roots of unity for any k >= 2.) --Dan