suppose you write, clockwise, n numbers in a circle. you then color each k-th number. you do this until you've colored all n numbers, or until you've reached an already colored number. let x be the number of colored numbers.
i've figured that if gcd(n,k)=1, if they're coprime, the whole circle...