challenge to maths
posted by Anonymous .
n buckets are arranged in a circle, each containing 1 token. Starting with one of the buckets, you take out a coin and move it into the next bucket counterclockwise. You then take two tokens out of this bucket and move them into the next one. This process is repeated over and over, alternating moving one token and then two tokens. When all tokens are removed from a bucket, it is removed from the circle. For how many positive integer values of n<1000 will all the tokens eventually end up in a single bucket?
20 (no of the form 2^k+1 and 2^k+2 between 1 and 1000)