Wednesday
August 20, 2014

Homework Help: challenge to maths

Posted by Anonymous on Wednesday, June 12, 2013 at 7:10am.

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?

Answer this Question

First Name:
School Subject:
Answer:

Related Questions

MATHS - Two (2) Buckets were bought for X dollars each ($X) and a third bucket ...
m - Two (2) Buckets were bought for X dollars each ($X) and a third bucket is ...
algebra - when jill sells 2 more buckets she will have sold 3 times asmany ...
Algebra II - You have a 12 gallon bucket filled with water, and empty 7 and 5 ...
math - Two players play a game on the Cartesian plane. The game starts by ...
math - At the greenhouse where you work you need to make soil and vermiculite ...
Physics - So I got a question One 3.5-kg paint bucket is hanging by a massless ...
algebra - Please help me? Chicken Dinners. High Flyin' Wings charges $12 for a ...
Physics - I posted this question earlier and I still don't get it So I got a ...
math - A token is placed on the corner square of a 33 chess board. The token is...

Search
Members